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/Problem11_label28_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:03:28,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:03:28,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:03:28,895 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:03:28,895 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:03:28,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:03:28,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:03:28,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:03:28,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:03:28,904 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:03:28,905 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:03:28,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:03:28,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:03:28,908 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:03:28,909 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:03:28,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:03:28,910 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:03:28,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:03:28,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:03:28,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:03:28,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:03:28,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:03:28,931 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:03:28,931 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:03:28,931 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:03:28,932 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:03:28,933 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:03:28,934 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:03:28,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:03:28,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:03:28,938 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:03:28,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:03:28,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:03:28,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:03:28,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:03:28,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:03:28,942 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:03:28,971 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:03:28,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:03:28,972 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:03:28,973 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:03:28,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:03:28,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:03:28,974 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:03:28,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:03:28,974 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:03:28,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:03:28,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:03:28,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:03:28,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:03:28,975 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:03:28,975 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:03:28,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:03:28,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:03:28,977 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:03:28,977 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:03:28,977 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:03:28,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:03:28,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:03:28,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:03:28,978 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:03:28,978 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:03:28,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:03:28,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:03:28,979 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:03:29,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:03:29,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:03:29,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:03:29,064 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:03:29,065 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:03:29,065 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label28_true-unreach-call.c [2018-11-06 21:03:29,125 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ea099f6/8a574e95a6504aaebf108752334f4e46/FLAG8a962e890 [2018-11-06 21:03:29,795 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:03:29,795 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label28_true-unreach-call.c [2018-11-06 21:03:29,826 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ea099f6/8a574e95a6504aaebf108752334f4e46/FLAG8a962e890 [2018-11-06 21:03:29,854 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ea099f6/8a574e95a6504aaebf108752334f4e46 [2018-11-06 21:03:29,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:03:29,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:03:29,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:03:29,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:03:29,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:03:29,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:03:29" (1/1) ... [2018-11-06 21:03:29,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c594769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:29, skipping insertion in model container [2018-11-06 21:03:29,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:03:29" (1/1) ... [2018-11-06 21:03:29,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:03:29,983 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:03:30,652 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:03:30,657 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:03:30,861 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:03:30,882 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:03:30,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30 WrapperNode [2018-11-06 21:03:30,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:03:30,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:03:30,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:03:30,884 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:03:30,895 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:03:30" (1/1) ... [2018-11-06 21:03:31,023 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:03:30" (1/1) ... [2018-11-06 21:03:31,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:03:31,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:03:31,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:03:31,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:03:31,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (1/1) ... [2018-11-06 21:03:31,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:03:31,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:03:31,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:03:31,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:03:31,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (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:03:31,353 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:03:31,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:03:31,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:03:35,776 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:03:35,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:03:35 BoogieIcfgContainer [2018-11-06 21:03:35,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:03:35,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:03:35,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:03:35,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:03:35,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:03:29" (1/3) ... [2018-11-06 21:03:35,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c86b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:03:35, skipping insertion in model container [2018-11-06 21:03:35,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:03:30" (2/3) ... [2018-11-06 21:03:35,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c86b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:03:35, skipping insertion in model container [2018-11-06 21:03:35,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:03:35" (3/3) ... [2018-11-06 21:03:35,785 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label28_true-unreach-call.c [2018-11-06 21:03:35,795 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:03:35,805 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:03:35,824 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:03:35,863 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:03:35,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:03:35,865 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:03:35,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:03:35,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:03:35,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:03:35,866 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:03:35,866 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:03:35,866 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:03:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:03:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-06 21:03:35,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:35,902 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] [2018-11-06 21:03:35,904 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:35,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:35,911 INFO L82 PathProgramCache]: Analyzing trace with hash 55000978, now seen corresponding path program 1 times [2018-11-06 21:03:35,913 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:35,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:35,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:35,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:36,377 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:03:36,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:36,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:03:36,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:36,406 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:03:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:39,462 INFO L93 Difference]: Finished difference Result 972 states and 1744 transitions. [2018-11-06 21:03:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:39,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-06 21:03:39,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:39,488 INFO L225 Difference]: With dead ends: 972 [2018-11-06 21:03:39,489 INFO L226 Difference]: Without dead ends: 681 [2018-11-06 21:03:39,494 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:03:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-06 21:03:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 469. [2018-11-06 21:03:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-11-06 21:03:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 728 transitions. [2018-11-06 21:03:39,572 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 728 transitions. Word has length 49 [2018-11-06 21:03:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:39,573 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 728 transitions. [2018-11-06 21:03:39,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 728 transitions. [2018-11-06 21:03:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-06 21:03:39,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:39,579 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, 1, 1, 1, 1, 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:03:39,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:39,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1093376710, now seen corresponding path program 1 times [2018-11-06 21:03:39,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:39,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:39,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:39,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:39,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:39,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:03:39,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:39,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:39,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:39,943 INFO L87 Difference]: Start difference. First operand 469 states and 728 transitions. Second operand 4 states. [2018-11-06 21:03:43,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:43,440 INFO L93 Difference]: Finished difference Result 1695 states and 2717 transitions. [2018-11-06 21:03:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:43,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-11-06 21:03:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:43,450 INFO L225 Difference]: With dead ends: 1695 [2018-11-06 21:03:43,450 INFO L226 Difference]: Without dead ends: 1228 [2018-11-06 21:03:43,453 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:03:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-11-06 21:03:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1214. [2018-11-06 21:03:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-06 21:03:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1784 transitions. [2018-11-06 21:03:43,507 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1784 transitions. Word has length 118 [2018-11-06 21:03:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:43,508 INFO L480 AbstractCegarLoop]: Abstraction has 1214 states and 1784 transitions. [2018-11-06 21:03:43,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1784 transitions. [2018-11-06 21:03:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-06 21:03:43,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:43,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:43,514 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:43,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1523603117, now seen corresponding path program 1 times [2018-11-06 21:03:43,515 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:43,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:43,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:43,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:43,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:03:43,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:03:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:03:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:43,681 INFO L87 Difference]: Start difference. First operand 1214 states and 1784 transitions. Second operand 3 states. [2018-11-06 21:03:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:46,755 INFO L93 Difference]: Finished difference Result 3354 states and 4986 transitions. [2018-11-06 21:03:46,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:46,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-11-06 21:03:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:46,769 INFO L225 Difference]: With dead ends: 3354 [2018-11-06 21:03:46,769 INFO L226 Difference]: Without dead ends: 2142 [2018-11-06 21:03:46,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2018-11-06 21:03:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2142. [2018-11-06 21:03:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2018-11-06 21:03:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2951 transitions. [2018-11-06 21:03:46,819 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2951 transitions. Word has length 143 [2018-11-06 21:03:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:46,820 INFO L480 AbstractCegarLoop]: Abstraction has 2142 states and 2951 transitions. [2018-11-06 21:03:46,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:03:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2951 transitions. [2018-11-06 21:03:46,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-06 21:03:46,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:46,829 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:46,830 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:46,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:46,830 INFO L82 PathProgramCache]: Analyzing trace with hash -513320534, now seen corresponding path program 1 times [2018-11-06 21:03:46,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:46,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:46,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:46,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:47,437 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:03:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:47,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:47,484 INFO L87 Difference]: Start difference. First operand 2142 states and 2951 transitions. Second operand 4 states. [2018-11-06 21:03:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:49,555 INFO L93 Difference]: Finished difference Result 5779 states and 8068 transitions. [2018-11-06 21:03:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:49,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2018-11-06 21:03:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:49,575 INFO L225 Difference]: With dead ends: 5779 [2018-11-06 21:03:49,575 INFO L226 Difference]: Without dead ends: 3639 [2018-11-06 21:03:49,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:49,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2018-11-06 21:03:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3622. [2018-11-06 21:03:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2018-11-06 21:03:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 4739 transitions. [2018-11-06 21:03:49,658 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 4739 transitions. Word has length 239 [2018-11-06 21:03:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:49,659 INFO L480 AbstractCegarLoop]: Abstraction has 3622 states and 4739 transitions. [2018-11-06 21:03:49,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 4739 transitions. [2018-11-06 21:03:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-11-06 21:03:49,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:49,667 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:03:49,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:49,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash -725868575, now seen corresponding path program 1 times [2018-11-06 21:03:49,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:49,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:49,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:50,231 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 21:03:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:50,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:50,291 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:03:50,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:50,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:51,205 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 488 DAG size of output: 21 [2018-11-06 21:03:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:03:51,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:03:51,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:03:51,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:03:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:03:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:03:51,519 INFO L87 Difference]: Start difference. First operand 3622 states and 4739 transitions. Second operand 6 states. [2018-11-06 21:04:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:03,057 INFO L93 Difference]: Finished difference Result 14159 states and 18682 transitions. [2018-11-06 21:04:03,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:04:03,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 260 [2018-11-06 21:04:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:03,098 INFO L225 Difference]: With dead ends: 14159 [2018-11-06 21:04:03,098 INFO L226 Difference]: Without dead ends: 10539 [2018-11-06 21:04:03,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:04:03,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10539 states. [2018-11-06 21:04:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10539 to 9397. [2018-11-06 21:04:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9397 states. [2018-11-06 21:04:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9397 states to 9397 states and 11813 transitions. [2018-11-06 21:04:03,325 INFO L78 Accepts]: Start accepts. Automaton has 9397 states and 11813 transitions. Word has length 260 [2018-11-06 21:04:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:03,326 INFO L480 AbstractCegarLoop]: Abstraction has 9397 states and 11813 transitions. [2018-11-06 21:04:03,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:04:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 9397 states and 11813 transitions. [2018-11-06 21:04:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-06 21:04:03,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:03,337 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:03,337 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:03,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash -502869374, now seen corresponding path program 1 times [2018-11-06 21:04:03,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:03,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:03,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:03,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:03,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:03,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:03,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:03,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:04:03,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:04:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:03,944 INFO L87 Difference]: Start difference. First operand 9397 states and 11813 transitions. Second operand 5 states. [2018-11-06 21:04:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:07,303 INFO L93 Difference]: Finished difference Result 19174 states and 24317 transitions. [2018-11-06 21:04:07,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:04:07,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 266 [2018-11-06 21:04:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:07,342 INFO L225 Difference]: With dead ends: 19174 [2018-11-06 21:04:07,342 INFO L226 Difference]: Without dead ends: 9779 [2018-11-06 21:04:07,353 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:04:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2018-11-06 21:04:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 9774. [2018-11-06 21:04:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9774 states. [2018-11-06 21:04:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9774 states to 9774 states and 11925 transitions. [2018-11-06 21:04:07,537 INFO L78 Accepts]: Start accepts. Automaton has 9774 states and 11925 transitions. Word has length 266 [2018-11-06 21:04:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:07,538 INFO L480 AbstractCegarLoop]: Abstraction has 9774 states and 11925 transitions. [2018-11-06 21:04:07,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:04:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 9774 states and 11925 transitions. [2018-11-06 21:04:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-06 21:04:07,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:07,546 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:04:07,546 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:07,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1826592508, now seen corresponding path program 1 times [2018-11-06 21:04:07,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:07,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:07,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 11 proven. 82 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:04:08,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:08,058 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:04:08,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:08,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:04:08,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:04:08,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-06 21:04:08,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:04:08,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:04:08,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:08,386 INFO L87 Difference]: Start difference. First operand 9774 states and 11925 transitions. Second operand 5 states. [2018-11-06 21:04:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:11,406 INFO L93 Difference]: Finished difference Result 31197 states and 37436 transitions. [2018-11-06 21:04:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:04:11,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-11-06 21:04:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:11,447 INFO L225 Difference]: With dead ends: 31197 [2018-11-06 21:04:11,447 INFO L226 Difference]: Without dead ends: 21425 [2018-11-06 21:04:11,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21425 states. [2018-11-06 21:04:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21425 to 17349. [2018-11-06 21:04:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17349 states. [2018-11-06 21:04:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17349 states to 17349 states and 20272 transitions. [2018-11-06 21:04:11,727 INFO L78 Accepts]: Start accepts. Automaton has 17349 states and 20272 transitions. Word has length 269 [2018-11-06 21:04:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:11,727 INFO L480 AbstractCegarLoop]: Abstraction has 17349 states and 20272 transitions. [2018-11-06 21:04:11,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:04:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17349 states and 20272 transitions. [2018-11-06 21:04:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-11-06 21:04:11,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:11,740 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:04:11,740 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:11,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:11,741 INFO L82 PathProgramCache]: Analyzing trace with hash -463655850, now seen corresponding path program 1 times [2018-11-06 21:04:11,741 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:11,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:11,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:11,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 149 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 21:04:12,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:12,160 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:04:12,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:12,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 21:04:12,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:04:12,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-06 21:04:12,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:12,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:12,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:12,362 INFO L87 Difference]: Start difference. First operand 17349 states and 20272 transitions. Second operand 4 states. [2018-11-06 21:04:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:13,783 INFO L93 Difference]: Finished difference Result 33759 states and 39455 transitions. [2018-11-06 21:04:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:04:13,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-11-06 21:04:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:13,814 INFO L225 Difference]: With dead ends: 33759 [2018-11-06 21:04:13,814 INFO L226 Difference]: Without dead ends: 16784 [2018-11-06 21:04:13,832 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 282 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:04:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16784 states. [2018-11-06 21:04:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16784 to 16414. [2018-11-06 21:04:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16414 states. [2018-11-06 21:04:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16414 states to 16414 states and 18695 transitions. [2018-11-06 21:04:14,029 INFO L78 Accepts]: Start accepts. Automaton has 16414 states and 18695 transitions. Word has length 281 [2018-11-06 21:04:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:14,030 INFO L480 AbstractCegarLoop]: Abstraction has 16414 states and 18695 transitions. [2018-11-06 21:04:14,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 16414 states and 18695 transitions. [2018-11-06 21:04:14,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-06 21:04:14,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:14,041 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:04:14,042 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:14,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1510454922, now seen corresponding path program 1 times [2018-11-06 21:04:14,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:14,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:14,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:14,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:14,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:14,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:14,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:14,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:14,391 INFO L87 Difference]: Start difference. First operand 16414 states and 18695 transitions. Second operand 4 states. [2018-11-06 21:04:16,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:16,277 INFO L93 Difference]: Finished difference Result 33950 states and 38657 transitions. [2018-11-06 21:04:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:16,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-11-06 21:04:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:16,304 INFO L225 Difference]: With dead ends: 33950 [2018-11-06 21:04:16,305 INFO L226 Difference]: Without dead ends: 17910 [2018-11-06 21:04:16,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:04:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-11-06 21:04:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 17156. [2018-11-06 21:04:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17156 states. [2018-11-06 21:04:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17156 states to 17156 states and 19480 transitions. [2018-11-06 21:04:16,516 INFO L78 Accepts]: Start accepts. Automaton has 17156 states and 19480 transitions. Word has length 284 [2018-11-06 21:04:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:16,517 INFO L480 AbstractCegarLoop]: Abstraction has 17156 states and 19480 transitions. [2018-11-06 21:04:16,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 17156 states and 19480 transitions. [2018-11-06 21:04:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-06 21:04:16,529 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:16,529 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:04:16,530 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:16,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1622261481, now seen corresponding path program 1 times [2018-11-06 21:04:16,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:16,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:16,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 21:04:16,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:16,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:16,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:04:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:04:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:16,782 INFO L87 Difference]: Start difference. First operand 17156 states and 19480 transitions. Second operand 3 states. [2018-11-06 21:04:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:17,979 INFO L93 Difference]: Finished difference Result 39487 states and 44913 transitions. [2018-11-06 21:04:17,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:04:17,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-06 21:04:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:18,005 INFO L225 Difference]: With dead ends: 39487 [2018-11-06 21:04:18,006 INFO L226 Difference]: Without dead ends: 21404 [2018-11-06 21:04:18,020 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21404 states. [2018-11-06 21:04:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21404 to 20664. [2018-11-06 21:04:18,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20664 states. [2018-11-06 21:04:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20664 states to 20664 states and 23124 transitions. [2018-11-06 21:04:18,253 INFO L78 Accepts]: Start accepts. Automaton has 20664 states and 23124 transitions. Word has length 313 [2018-11-06 21:04:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:18,254 INFO L480 AbstractCegarLoop]: Abstraction has 20664 states and 23124 transitions. [2018-11-06 21:04:18,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:04:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20664 states and 23124 transitions. [2018-11-06 21:04:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-06 21:04:18,272 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:18,272 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:18,272 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:18,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:18,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1532488535, now seen corresponding path program 1 times [2018-11-06 21:04:18,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:18,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:18,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 21:04:18,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:18,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:18,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:04:18,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:04:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:18,642 INFO L87 Difference]: Start difference. First operand 20664 states and 23124 transitions. Second operand 3 states. [2018-11-06 21:04:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:21,554 INFO L93 Difference]: Finished difference Result 41142 states and 46094 transitions. [2018-11-06 21:04:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:04:21,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-11-06 21:04:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:21,573 INFO L225 Difference]: With dead ends: 41142 [2018-11-06 21:04:21,573 INFO L226 Difference]: Without dead ends: 19548 [2018-11-06 21:04:21,584 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19548 states. [2018-11-06 21:04:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19548 to 18991. [2018-11-06 21:04:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18991 states. [2018-11-06 21:04:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18991 states to 18991 states and 21059 transitions. [2018-11-06 21:04:21,797 INFO L78 Accepts]: Start accepts. Automaton has 18991 states and 21059 transitions. Word has length 339 [2018-11-06 21:04:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 18991 states and 21059 transitions. [2018-11-06 21:04:21,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:04:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 18991 states and 21059 transitions. [2018-11-06 21:04:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-06 21:04:21,810 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:21,811 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:21,811 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:21,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1361478743, now seen corresponding path program 1 times [2018-11-06 21:04:21,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:21,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:21,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:21,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:22,420 WARN L179 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-11-06 21:04:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-06 21:04:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:22,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:22,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:22,562 INFO L87 Difference]: Start difference. First operand 18991 states and 21059 transitions. Second operand 4 states. [2018-11-06 21:04:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:24,399 INFO L93 Difference]: Finished difference Result 36863 states and 40930 transitions. [2018-11-06 21:04:24,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:24,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2018-11-06 21:04:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:24,414 INFO L225 Difference]: With dead ends: 36863 [2018-11-06 21:04:24,414 INFO L226 Difference]: Without dead ends: 17501 [2018-11-06 21:04:24,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17501 states. [2018-11-06 21:04:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17501 to 17313. [2018-11-06 21:04:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17313 states. [2018-11-06 21:04:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17313 states to 17313 states and 19097 transitions. [2018-11-06 21:04:24,614 INFO L78 Accepts]: Start accepts. Automaton has 17313 states and 19097 transitions. Word has length 340 [2018-11-06 21:04:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:24,615 INFO L480 AbstractCegarLoop]: Abstraction has 17313 states and 19097 transitions. [2018-11-06 21:04:24,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17313 states and 19097 transitions. [2018-11-06 21:04:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-11-06 21:04:24,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:24,630 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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:04:24,631 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:24,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1149795893, now seen corresponding path program 1 times [2018-11-06 21:04:24,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:24,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:24,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:24,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-06 21:04:24,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:24,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:24,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:24,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:24,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:24,968 INFO L87 Difference]: Start difference. First operand 17313 states and 19097 transitions. Second operand 4 states. [2018-11-06 21:04:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:26,868 INFO L93 Difference]: Finished difference Result 34261 states and 37822 transitions. [2018-11-06 21:04:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:26,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 383 [2018-11-06 21:04:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:26,889 INFO L225 Difference]: With dead ends: 34261 [2018-11-06 21:04:26,889 INFO L226 Difference]: Without dead ends: 17135 [2018-11-06 21:04:26,902 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:04:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17135 states. [2018-11-06 21:04:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17135 to 16755. [2018-11-06 21:04:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16755 states. [2018-11-06 21:04:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 18270 transitions. [2018-11-06 21:04:27,137 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 18270 transitions. Word has length 383 [2018-11-06 21:04:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:27,138 INFO L480 AbstractCegarLoop]: Abstraction has 16755 states and 18270 transitions. [2018-11-06 21:04:27,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 18270 transitions. [2018-11-06 21:04:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-06 21:04:27,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:27,155 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:27,156 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:27,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:27,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1795904804, now seen corresponding path program 1 times [2018-11-06 21:04:27,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:27,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:27,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 448 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:27,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:27,727 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:04:27,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:27,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-06 21:04:28,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:04:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 21:04:28,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:04:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:04:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:04:28,080 INFO L87 Difference]: Start difference. First operand 16755 states and 18270 transitions. Second operand 6 states. [2018-11-06 21:04:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:29,622 INFO L93 Difference]: Finished difference Result 32956 states and 35966 transitions. [2018-11-06 21:04:29,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:29,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 388 [2018-11-06 21:04:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:29,638 INFO L225 Difference]: With dead ends: 32956 [2018-11-06 21:04:29,638 INFO L226 Difference]: Without dead ends: 16760 [2018-11-06 21:04:29,647 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:04:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16760 states. [2018-11-06 21:04:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16760 to 16755. [2018-11-06 21:04:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16755 states. [2018-11-06 21:04:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16755 states to 16755 states and 18254 transitions. [2018-11-06 21:04:29,791 INFO L78 Accepts]: Start accepts. Automaton has 16755 states and 18254 transitions. Word has length 388 [2018-11-06 21:04:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:29,792 INFO L480 AbstractCegarLoop]: Abstraction has 16755 states and 18254 transitions. [2018-11-06 21:04:29,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:04:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 16755 states and 18254 transitions. [2018-11-06 21:04:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-11-06 21:04:29,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:29,805 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:29,806 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:29,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash 768596239, now seen corresponding path program 1 times [2018-11-06 21:04:29,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:29,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:29,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:29,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:29,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 246 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:30,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:30,864 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:30,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:30,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:31,252 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 21:04:31,821 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2018-11-06 21:04:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 246 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:32,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:32,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-06 21:04:32,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:04:32,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:04:32,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:04:32,586 INFO L87 Difference]: Start difference. First operand 16755 states and 18254 transitions. Second operand 12 states. [2018-11-06 21:04:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:43,784 INFO L93 Difference]: Finished difference Result 38389 states and 41730 transitions. [2018-11-06 21:04:43,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-06 21:04:43,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 419 [2018-11-06 21:04:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:43,802 INFO L225 Difference]: With dead ends: 38389 [2018-11-06 21:04:43,802 INFO L226 Difference]: Without dead ends: 22193 [2018-11-06 21:04:43,810 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2018-11-06 21:04:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22193 states. [2018-11-06 21:04:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22193 to 16559. [2018-11-06 21:04:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16559 states. [2018-11-06 21:04:43,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16559 states to 16559 states and 17964 transitions. [2018-11-06 21:04:43,970 INFO L78 Accepts]: Start accepts. Automaton has 16559 states and 17964 transitions. Word has length 419 [2018-11-06 21:04:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:43,971 INFO L480 AbstractCegarLoop]: Abstraction has 16559 states and 17964 transitions. [2018-11-06 21:04:43,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:04:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16559 states and 17964 transitions. [2018-11-06 21:04:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-11-06 21:04:43,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:43,980 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:43,980 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:43,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2089389463, now seen corresponding path program 1 times [2018-11-06 21:04:43,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:43,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:43,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 339 proven. 121 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 21:04:44,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:44,720 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:44,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:44,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-06 21:04:45,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:04:45,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2018-11-06 21:04:45,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:04:45,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:04:45,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:04:45,161 INFO L87 Difference]: Start difference. First operand 16559 states and 17964 transitions. Second operand 8 states. [2018-11-06 21:04:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:46,463 INFO L93 Difference]: Finished difference Result 32578 states and 35364 transitions. [2018-11-06 21:04:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:04:46,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 420 [2018-11-06 21:04:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:46,476 INFO L225 Difference]: With dead ends: 32578 [2018-11-06 21:04:46,476 INFO L226 Difference]: Without dead ends: 16373 [2018-11-06 21:04:46,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 415 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:04:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16373 states. [2018-11-06 21:04:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16373 to 16373. [2018-11-06 21:04:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16373 states. [2018-11-06 21:04:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16373 states to 16373 states and 17739 transitions. [2018-11-06 21:04:46,611 INFO L78 Accepts]: Start accepts. Automaton has 16373 states and 17739 transitions. Word has length 420 [2018-11-06 21:04:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:46,611 INFO L480 AbstractCegarLoop]: Abstraction has 16373 states and 17739 transitions. [2018-11-06 21:04:46,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:04:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16373 states and 17739 transitions. [2018-11-06 21:04:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-11-06 21:04:46,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:46,619 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:46,619 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:46,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1110516759, now seen corresponding path program 1 times [2018-11-06 21:04:46,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:46,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:46,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 322 proven. 103 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 21:04:47,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:47,095 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:47,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:47,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 322 proven. 103 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 21:04:48,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:48,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-11-06 21:04:48,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 21:04:48,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 21:04:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:04:48,071 INFO L87 Difference]: Start difference. First operand 16373 states and 17739 transitions. Second operand 7 states. [2018-11-06 21:04:48,239 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-06 21:04:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:51,606 INFO L93 Difference]: Finished difference Result 37755 states and 40959 transitions. [2018-11-06 21:04:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:04:51,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 426 [2018-11-06 21:04:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:51,626 INFO L225 Difference]: With dead ends: 37755 [2018-11-06 21:04:51,626 INFO L226 Difference]: Without dead ends: 21941 [2018-11-06 21:04:51,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 423 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:04:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21941 states. [2018-11-06 21:04:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21941 to 18222. [2018-11-06 21:04:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18222 states. [2018-11-06 21:04:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18222 states to 18222 states and 19606 transitions. [2018-11-06 21:04:51,834 INFO L78 Accepts]: Start accepts. Automaton has 18222 states and 19606 transitions. Word has length 426 [2018-11-06 21:04:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:51,834 INFO L480 AbstractCegarLoop]: Abstraction has 18222 states and 19606 transitions. [2018-11-06 21:04:51,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 21:04:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18222 states and 19606 transitions. [2018-11-06 21:04:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-11-06 21:04:51,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:51,848 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:04:51,848 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:51,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash -642383833, now seen corresponding path program 1 times [2018-11-06 21:04:51,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:51,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:51,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:52,289 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-11-06 21:04:52,588 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-11-06 21:04:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-06 21:04:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:52,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:52,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:52,910 INFO L87 Difference]: Start difference. First operand 18222 states and 19606 transitions. Second operand 4 states. [2018-11-06 21:04:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:55,036 INFO L93 Difference]: Finished difference Result 36639 states and 39405 transitions. [2018-11-06 21:04:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:55,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 479 [2018-11-06 21:04:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:55,051 INFO L225 Difference]: With dead ends: 36639 [2018-11-06 21:04:55,051 INFO L226 Difference]: Without dead ends: 18605 [2018-11-06 21:04:55,056 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18605 states. [2018-11-06 21:04:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18605 to 16739. [2018-11-06 21:04:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16739 states. [2018-11-06 21:04:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16739 states to 16739 states and 17879 transitions. [2018-11-06 21:04:55,203 INFO L78 Accepts]: Start accepts. Automaton has 16739 states and 17879 transitions. Word has length 479 [2018-11-06 21:04:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:55,203 INFO L480 AbstractCegarLoop]: Abstraction has 16739 states and 17879 transitions. [2018-11-06 21:04:55,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 16739 states and 17879 transitions. [2018-11-06 21:04:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-11-06 21:04:55,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:55,216 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:04:55,216 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:55,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:55,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2025793875, now seen corresponding path program 1 times [2018-11-06 21:04:55,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:55,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:55,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:55,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:55,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 426 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2018-11-06 21:04:55,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:55,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:55,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:04:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:04:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:55,622 INFO L87 Difference]: Start difference. First operand 16739 states and 17879 transitions. Second operand 3 states. [2018-11-06 21:04:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:57,773 INFO L93 Difference]: Finished difference Result 32910 states and 35124 transitions. [2018-11-06 21:04:57,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:04:57,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2018-11-06 21:04:57,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:57,786 INFO L225 Difference]: With dead ends: 32910 [2018-11-06 21:04:57,786 INFO L226 Difference]: Without dead ends: 13567 [2018-11-06 21:04:57,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13567 states. [2018-11-06 21:04:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13567 to 12272. [2018-11-06 21:04:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12272 states. [2018-11-06 21:04:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12272 states to 12272 states and 12965 transitions. [2018-11-06 21:04:57,916 INFO L78 Accepts]: Start accepts. Automaton has 12272 states and 12965 transitions. Word has length 491 [2018-11-06 21:04:57,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:57,916 INFO L480 AbstractCegarLoop]: Abstraction has 12272 states and 12965 transitions. [2018-11-06 21:04:57,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:04:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 12272 states and 12965 transitions. [2018-11-06 21:04:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-11-06 21:04:57,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:57,928 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 21:04:57,928 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:57,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:57,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1563719829, now seen corresponding path program 1 times [2018-11-06 21:04:57,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:57,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:58,500 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-06 21:04:58,937 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-06 21:04:59,540 WARN L179 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-11-06 21:04:59,826 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-11-06 21:05:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 550 proven. 224 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 21:05:00,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:00,444 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:00,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:00,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 550 proven. 224 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-06 21:05:01,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:01,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 12 [2018-11-06 21:05:01,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-06 21:05:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-06 21:05:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:05:01,480 INFO L87 Difference]: Start difference. First operand 12272 states and 12965 transitions. Second operand 13 states. [2018-11-06 21:05:02,431 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-11-06 21:05:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:08,448 INFO L93 Difference]: Finished difference Result 27974 states and 29498 transitions. [2018-11-06 21:05:08,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-06 21:05:08,452 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 539 [2018-11-06 21:05:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:08,466 INFO L225 Difference]: With dead ends: 27974 [2018-11-06 21:05:08,467 INFO L226 Difference]: Without dead ends: 16261 [2018-11-06 21:05:08,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 534 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=327, Invalid=603, Unknown=0, NotChecked=0, Total=930 [2018-11-06 21:05:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2018-11-06 21:05:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 10599. [2018-11-06 21:05:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10599 states. [2018-11-06 21:05:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 11191 transitions. [2018-11-06 21:05:08,593 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 11191 transitions. Word has length 539 [2018-11-06 21:05:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:08,593 INFO L480 AbstractCegarLoop]: Abstraction has 10599 states and 11191 transitions. [2018-11-06 21:05:08,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-06 21:05:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 11191 transitions. [2018-11-06 21:05:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2018-11-06 21:05:08,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:08,602 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:05:08,602 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:08,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:08,603 INFO L82 PathProgramCache]: Analyzing trace with hash -573851852, now seen corresponding path program 1 times [2018-11-06 21:05:08,603 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:08,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:08,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:08,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2018-11-06 21:05:10,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:10,148 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:10,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:10,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 847 backedges. 239 proven. 457 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-06 21:05:11,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:11,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-06 21:05:11,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:05:11,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:05:11,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:05:11,707 INFO L87 Difference]: Start difference. First operand 10599 states and 11191 transitions. Second operand 9 states. [2018-11-06 21:05:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:16,439 INFO L93 Difference]: Finished difference Result 33797 states and 35715 transitions. [2018-11-06 21:05:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 21:05:16,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 575 [2018-11-06 21:05:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:16,463 INFO L225 Difference]: With dead ends: 33797 [2018-11-06 21:05:16,463 INFO L226 Difference]: Without dead ends: 23200 [2018-11-06 21:05:16,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 571 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:05:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23200 states. [2018-11-06 21:05:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23200 to 13012. [2018-11-06 21:05:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13012 states. [2018-11-06 21:05:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13012 states to 13012 states and 13702 transitions. [2018-11-06 21:05:16,648 INFO L78 Accepts]: Start accepts. Automaton has 13012 states and 13702 transitions. Word has length 575 [2018-11-06 21:05:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:16,649 INFO L480 AbstractCegarLoop]: Abstraction has 13012 states and 13702 transitions. [2018-11-06 21:05:16,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:05:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 13012 states and 13702 transitions. [2018-11-06 21:05:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2018-11-06 21:05:16,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:16,660 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:16,660 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:16,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1119073345, now seen corresponding path program 1 times [2018-11-06 21:05:16,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:16,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 975 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2018-11-06 21:05:17,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:17,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:17,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:17,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:17,346 INFO L87 Difference]: Start difference. First operand 13012 states and 13702 transitions. Second operand 5 states. [2018-11-06 21:05:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:19,286 INFO L93 Difference]: Finished difference Result 29174 states and 30763 transitions. [2018-11-06 21:05:19,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:19,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 625 [2018-11-06 21:05:19,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:19,305 INFO L225 Difference]: With dead ends: 29174 [2018-11-06 21:05:19,305 INFO L226 Difference]: Without dead ends: 17457 [2018-11-06 21:05:19,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:05:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17457 states. [2018-11-06 21:05:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17457 to 15230. [2018-11-06 21:05:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15230 states. [2018-11-06 21:05:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15230 states to 15230 states and 16038 transitions. [2018-11-06 21:05:19,483 INFO L78 Accepts]: Start accepts. Automaton has 15230 states and 16038 transitions. Word has length 625 [2018-11-06 21:05:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:19,484 INFO L480 AbstractCegarLoop]: Abstraction has 15230 states and 16038 transitions. [2018-11-06 21:05:19,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 15230 states and 16038 transitions. [2018-11-06 21:05:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-11-06 21:05:19,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:19,496 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:05:19,496 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:19,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:19,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1804517051, now seen corresponding path program 1 times [2018-11-06 21:05:19,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:19,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:19,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:19,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:19,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 756 proven. 239 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-06 21:05:20,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:20,599 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:20,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:20,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 756 proven. 239 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-06 21:05:21,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:21,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-06 21:05:21,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:21,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:21,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:21,178 INFO L87 Difference]: Start difference. First operand 15230 states and 16038 transitions. Second operand 5 states. [2018-11-06 21:05:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:23,394 INFO L93 Difference]: Finished difference Result 32317 states and 33996 transitions. [2018-11-06 21:05:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:05:23,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 647 [2018-11-06 21:05:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:23,404 INFO L225 Difference]: With dead ends: 32317 [2018-11-06 21:05:23,405 INFO L226 Difference]: Without dead ends: 12042 [2018-11-06 21:05:23,414 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 646 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12042 states. [2018-11-06 21:05:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12042 to 7231. [2018-11-06 21:05:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7231 states. [2018-11-06 21:05:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7231 states to 7231 states and 7456 transitions. [2018-11-06 21:05:23,508 INFO L78 Accepts]: Start accepts. Automaton has 7231 states and 7456 transitions. Word has length 647 [2018-11-06 21:05:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:23,508 INFO L480 AbstractCegarLoop]: Abstraction has 7231 states and 7456 transitions. [2018-11-06 21:05:23,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7231 states and 7456 transitions. [2018-11-06 21:05:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2018-11-06 21:05:23,517 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:23,517 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:23,518 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:23,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1254010192, now seen corresponding path program 1 times [2018-11-06 21:05:23,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:23,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:24,316 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:05:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1331 proven. 220 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2018-11-06 21:05:24,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:24,966 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:24,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:25,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2381 backedges. 1284 proven. 97 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2018-11-06 21:05:26,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:26,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2018-11-06 21:05:26,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:05:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:05:26,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:05:26,161 INFO L87 Difference]: Start difference. First operand 7231 states and 7456 transitions. Second operand 8 states. [2018-11-06 21:05:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:30,619 INFO L93 Difference]: Finished difference Result 18720 states and 19344 transitions. [2018-11-06 21:05:30,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-06 21:05:30,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 850 [2018-11-06 21:05:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:30,631 INFO L225 Difference]: With dead ends: 18720 [2018-11-06 21:05:30,631 INFO L226 Difference]: Without dead ends: 12784 [2018-11-06 21:05:30,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-06 21:05:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12784 states. [2018-11-06 21:05:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12784 to 7230. [2018-11-06 21:05:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7230 states. [2018-11-06 21:05:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 7446 transitions. [2018-11-06 21:05:30,736 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 7446 transitions. Word has length 850 [2018-11-06 21:05:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:30,736 INFO L480 AbstractCegarLoop]: Abstraction has 7230 states and 7446 transitions. [2018-11-06 21:05:30,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:05:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 7446 transitions. [2018-11-06 21:05:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-11-06 21:05:30,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:30,747 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 21:05:30,747 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:30,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash -65126266, now seen corresponding path program 1 times [2018-11-06 21:05:30,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:30,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:30,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:30,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:30,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 1705 proven. 294 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-11-06 21:05:32,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:32,052 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:05:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:32,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:33,380 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 18 [2018-11-06 21:05:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2759 backedges. 396 proven. 2011 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-11-06 21:05:35,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:35,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-06 21:05:35,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-06 21:05:35,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-06 21:05:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-06 21:05:35,016 INFO L87 Difference]: Start difference. First operand 7230 states and 7446 transitions. Second operand 14 states. [2018-11-06 21:05:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:41,969 INFO L93 Difference]: Finished difference Result 11305 states and 11660 transitions. [2018-11-06 21:05:41,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:05:41,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 999 [2018-11-06 21:05:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:41,971 INFO L225 Difference]: With dead ends: 11305 [2018-11-06 21:05:41,971 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:05:41,975 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1007 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2018-11-06 21:05:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:05:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:05:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:05:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:05:41,976 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 999 [2018-11-06 21:05:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:41,976 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:05:41,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-06 21:05:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:05:41,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:05:41,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:05:42,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:42,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:42,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:42,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:42,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:42,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:42,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:43,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:43,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:44,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:44,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:44,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,821 WARN L179 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 922 DAG size of output: 741 [2018-11-06 21:05:45,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:45,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:46,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:47,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:47,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:47,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:48,485 WARN L179 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 919 DAG size of output: 741 [2018-11-06 21:06:00,758 WARN L179 SmtUtils]: Spent 12.26 s on a formula simplification. DAG size of input: 692 DAG size of output: 164 [2018-11-06 21:06:12,738 WARN L179 SmtUtils]: Spent 11.97 s on a formula simplification. DAG size of input: 692 DAG size of output: 164 [2018-11-06 21:06:12,742 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:06:12,742 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:06:12,742 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:06:12,742 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:06:12,742 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,742 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,743 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,744 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:06:12,745 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse22 (= ~a25~0 13)) (.cse29 (+ ~a23~0 43)) (.cse15 (= ~a25~0 9)) (.cse18 (= ~a4~0 1)) (.cse27 (<= ~a29~0 245)) (.cse19 (= ~a25~0 10))) (let ((.cse0 (and (not .cse15) .cse18 .cse27 (not .cse19))) (.cse13 (<= ~a29~0 277)) (.cse20 (<= 260 ~a29~0)) (.cse6 (and .cse18 .cse27)) (.cse23 (< 140 ~a29~0)) (.cse2 (= ~a25~0 11)) (.cse1 (<= 312 ~a23~0)) (.cse12 (< 0 .cse29)) (.cse21 (= 1 ~a3~0)) (.cse14 (< 245 ~a29~0)) (.cse7 (< 138 ~a23~0)) (.cse5 (= ~a25~0 12)) (.cse11 (<= ~a29~0 140)) (.cse9 (<= ~a4~0 0)) (.cse24 (not .cse22)) (.cse28 (<= 0 (+ ~a23~0 599913))) (.cse8 (= 15 ~a8~0)) (.cse16 (<= .cse29 0)) (.cse17 (= ~a8~0 15)) (.cse10 (<= ~a23~0 138)) (.cse4 (= ~a3~0 1))) (or (and (let ((.cse3 (<= 141 ~a29~0))) (or (and (and (and .cse0 .cse1) .cse2) .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse7 .cse4))) .cse8) (and .cse9 .cse10 .cse8 .cse11 (not .cse2) .cse12 .cse4) (or (and .cse9 .cse8 .cse5 .cse13 .cse14 .cse4) (and (and .cse8 (and .cse15 .cse9 (exists ((v_prenex_34 Int)) (and (<= (+ (mod v_prenex_34 299861) 10250) ~a29~0) (<= 0 v_prenex_34) (< 140 v_prenex_34))) .cse16)) .cse4)) (and .cse17 .cse18 (<= ~a23~0 306) .cse2 .cse4 .cse7) (and (or (and .cse11 .cse9 .cse8 .cse2 .cse16 .cse4) (and .cse11 .cse9 .cse8 .cse19 .cse4)) (<= 0 (+ ~a23~0 600262))) (and (and .cse18 .cse2 .cse20 .cse7) .cse21 .cse8) (and .cse22 .cse9 .cse10 .cse8 .cse12 .cse4) (and .cse15 .cse18 .cse16) (and .cse22 .cse17 .cse0 .cse23 .cse4 .cse16) (or (and .cse18 .cse8 .cse7 .cse5 .cse13 .cse14 .cse4) (and .cse18 .cse8 .cse2 .cse13 .cse14 .cse4)) (and .cse23 .cse18 .cse2 .cse16) (and .cse9 .cse24 .cse8 (exists ((v_~a23~0_479 Int)) (and (< 0 (+ v_~a23~0_479 43)) (<= (* 5 v_~a23~0_479) (+ ~a23~0 577632)))) .cse20 .cse4 .cse16) (and .cse6 .cse23 .cse10 .cse8 .cse2 .cse4) (and .cse18 .cse8 .cse2 (exists ((v_prenex_18 Int)) (let ((.cse26 (* 12 v_prenex_18))) (let ((.cse25 (div .cse26 10))) (and (<= 0 .cse25) (<= 0 .cse26) (<= (+ (div .cse25 5) 99853) ~a29~0) (< 245 v_prenex_18) (<= 0 (+ .cse25 1)))))) .cse4) (and .cse18 .cse8 .cse5 (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (and (<= (+ (div v_prenex_50 5) 553469) ~a23~0) (<= (+ v_prenex_50 43) 0) (< 0 (+ v_prenex_49 43)) (<= (* 5 v_prenex_49) (+ v_prenex_50 577632)) (< v_prenex_50 0) (not (= 0 (mod v_prenex_50 5))))) (<= ~a29~0 220) .cse4) (and (and .cse15 .cse1 .cse18) .cse21 .cse8) (and .cse22 .cse18 .cse8 .cse7 .cse4) (and .cse17 .cse18 .cse19 .cse4) (and .cse11 .cse15 .cse18) (and (and .cse5 .cse9 .cse12 .cse10) .cse21 .cse8) (and (and .cse15 .cse18 .cse8 .cse4) .cse14) (and (and .cse5 .cse27 .cse9 .cse8 .cse4) .cse28) (and .cse5 .cse18 .cse8 (<= ~a23~0 247) .cse4 .cse7) (and .cse18 .cse19 .cse16) (and .cse18 .cse10 .cse8 .cse11 .cse5 .cse4) (and .cse11 .cse9 .cse24 .cse28 .cse8 .cse16 .cse4) (and .cse15 .cse17 .cse18 .cse10 .cse4)))) [2018-11-06 21:06:12,745 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,745 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,745 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:12,746 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,747 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,748 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,749 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,750 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,751 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,752 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:06:12,753 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,754 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:06:12,755 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,756 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,757 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:12,758 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:06:12,759 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:06:12,760 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,761 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,762 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,763 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,764 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:06:12,765 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,766 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,767 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,768 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,769 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse22 (= ~a25~0 13)) (.cse29 (+ ~a23~0 43)) (.cse15 (= ~a25~0 9)) (.cse18 (= ~a4~0 1)) (.cse27 (<= ~a29~0 245)) (.cse19 (= ~a25~0 10))) (let ((.cse0 (and (not .cse15) .cse18 .cse27 (not .cse19))) (.cse13 (<= ~a29~0 277)) (.cse20 (<= 260 ~a29~0)) (.cse6 (and .cse18 .cse27)) (.cse23 (< 140 ~a29~0)) (.cse2 (= ~a25~0 11)) (.cse1 (<= 312 ~a23~0)) (.cse12 (< 0 .cse29)) (.cse21 (= 1 ~a3~0)) (.cse14 (< 245 ~a29~0)) (.cse7 (< 138 ~a23~0)) (.cse5 (= ~a25~0 12)) (.cse11 (<= ~a29~0 140)) (.cse9 (<= ~a4~0 0)) (.cse24 (not .cse22)) (.cse28 (<= 0 (+ ~a23~0 599913))) (.cse8 (= 15 ~a8~0)) (.cse16 (<= .cse29 0)) (.cse17 (= ~a8~0 15)) (.cse10 (<= ~a23~0 138)) (.cse4 (= ~a3~0 1))) (or (and (let ((.cse3 (<= 141 ~a29~0))) (or (and (and (and .cse0 .cse1) .cse2) .cse3 .cse4) (and .cse5 .cse6 .cse3 .cse7 .cse4))) .cse8) (and .cse9 .cse10 .cse8 .cse11 (not .cse2) .cse12 .cse4) (or (and .cse9 .cse8 .cse5 .cse13 .cse14 .cse4) (and (and .cse8 (and .cse15 .cse9 (exists ((v_prenex_34 Int)) (and (<= (+ (mod v_prenex_34 299861) 10250) ~a29~0) (<= 0 v_prenex_34) (< 140 v_prenex_34))) .cse16)) .cse4)) (and .cse17 .cse18 (<= ~a23~0 306) .cse2 .cse4 .cse7) (and (or (and .cse11 .cse9 .cse8 .cse2 .cse16 .cse4) (and .cse11 .cse9 .cse8 .cse19 .cse4)) (<= 0 (+ ~a23~0 600262))) (and (and .cse18 .cse2 .cse20 .cse7) .cse21 .cse8) (and .cse22 .cse9 .cse10 .cse8 .cse12 .cse4) (and .cse15 .cse18 .cse16) (and .cse22 .cse17 .cse0 .cse23 .cse4 .cse16) (or (and .cse18 .cse8 .cse7 .cse5 .cse13 .cse14 .cse4) (and .cse18 .cse8 .cse2 .cse13 .cse14 .cse4)) (and .cse23 .cse18 .cse2 .cse16) (and .cse9 .cse24 .cse8 (exists ((v_~a23~0_479 Int)) (and (< 0 (+ v_~a23~0_479 43)) (<= (* 5 v_~a23~0_479) (+ ~a23~0 577632)))) .cse20 .cse4 .cse16) (and .cse6 .cse23 .cse10 .cse8 .cse2 .cse4) (and .cse18 .cse8 .cse2 (exists ((v_prenex_18 Int)) (let ((.cse26 (* 12 v_prenex_18))) (let ((.cse25 (div .cse26 10))) (and (<= 0 .cse25) (<= 0 .cse26) (<= (+ (div .cse25 5) 99853) ~a29~0) (< 245 v_prenex_18) (<= 0 (+ .cse25 1)))))) .cse4) (and .cse18 .cse8 .cse5 (exists ((v_prenex_49 Int) (v_prenex_50 Int)) (and (<= (+ (div v_prenex_50 5) 553469) ~a23~0) (<= (+ v_prenex_50 43) 0) (< 0 (+ v_prenex_49 43)) (<= (* 5 v_prenex_49) (+ v_prenex_50 577632)) (< v_prenex_50 0) (not (= 0 (mod v_prenex_50 5))))) (<= ~a29~0 220) .cse4) (and (and .cse15 .cse1 .cse18) .cse21 .cse8) (and .cse22 .cse18 .cse8 .cse7 .cse4) (and .cse17 .cse18 .cse19 .cse4) (and .cse11 .cse15 .cse18) (and (and .cse5 .cse9 .cse12 .cse10) .cse21 .cse8) (and (and .cse15 .cse18 .cse8 .cse4) .cse14) (and (and .cse5 .cse27 .cse9 .cse8 .cse4) .cse28) (and .cse5 .cse18 .cse8 (<= ~a23~0 247) .cse4 .cse7) (and .cse18 .cse19 .cse16) (and .cse18 .cse10 .cse8 .cse11 .cse5 .cse4) (and .cse11 .cse9 .cse24 .cse28 .cse8 .cse16 .cse4) (and .cse15 .cse17 .cse18 .cse10 .cse4)))) [2018-11-06 21:06:12,769 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,769 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:12,769 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:12,769 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,769 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,769 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:06:12,770 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,770 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,770 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:12,782 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,783 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,784 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,785 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,786 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,787 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,788 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,788 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,788 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,788 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,789 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,789 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,801 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,802 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,802 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,803 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,803 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,804 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,804 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,804 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,805 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,806 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,807 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,813 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,813 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,814 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,815 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,816 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,817 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,818 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,818 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,818 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,822 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,822 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,822 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,823 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,823 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,823 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,824 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,824 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,824 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,824 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,825 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,825 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,825 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,826 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:12 BoogieIcfgContainer [2018-11-06 21:06:12,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:12,832 INFO L168 Benchmark]: Toolchain (without parser) took 162963.91 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,833 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:06:12,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1011.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 267.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,835 INFO L168 Benchmark]: Boogie Preprocessor took 129.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,838 INFO L168 Benchmark]: RCFGBuilder took 4495.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 169.7 MB). Peak memory consumption was 169.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,839 INFO L168 Benchmark]: TraceAbstraction took 157053.67 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -637.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:12,849 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1011.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 267.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4495.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 169.7 MB). Peak memory consumption was 169.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157053.67 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: -637.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-11-06 21:06:12,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,872 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,878 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,878 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,878 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,880 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,884 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,884 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,887 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,888 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,892 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,892 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,892 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,892 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,893 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,893 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,893 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 312 <= a23) && a25 == 11) && 141 <= a29) && a3 == 1) || ((((a25 == 12 && a4 == 1 && a29 <= 245) && 141 <= a29) && 138 < a23) && a3 == 1)) && 15 == a8) || ((((((a4 <= 0 && a23 <= 138) && 15 == a8) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && a3 == 1)) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && a29 <= 277) && 245 < a29) && a3 == 1) || ((15 == a8 && ((a25 == 9 && a4 <= 0) && (\exists v_prenex_34 : int :: (v_prenex_34 % 299861 + 10250 <= a29 && 0 <= v_prenex_34) && 140 < v_prenex_34)) && a23 + 43 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 == 1) && a23 <= 306) && a25 == 11) && a3 == 1) && 138 < a23)) || (((((((a29 <= 140 && a4 <= 0) && 15 == a8) && a25 == 11) && a23 + 43 <= 0) && a3 == 1) || ((((a29 <= 140 && a4 <= 0) && 15 == a8) && a25 == 10) && a3 == 1)) && 0 <= a23 + 600262)) || (((((a4 == 1 && a25 == 11) && 260 <= a29) && 138 < a23) && 1 == a3) && 15 == a8)) || (((((a25 == 13 && a4 <= 0) && a23 <= 138) && 15 == a8) && 0 < a23 + 43) && a3 == 1)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && ((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 140 < a29) && a3 == 1) && a23 + 43 <= 0)) || ((((((a4 == 1 && 15 == a8) && 138 < a23) && a25 == 12) && a29 <= 277) && 245 < a29) && a3 == 1) || (((((a4 == 1 && 15 == a8) && a25 == 11) && a29 <= 277) && 245 < a29) && a3 == 1)) || (((140 < a29 && a4 == 1) && a25 == 11) && a23 + 43 <= 0)) || ((((((a4 <= 0 && !(a25 == 13)) && 15 == a8) && (\exists v_~a23~0_479 : int :: 0 < v_~a23~0_479 + 43 && 5 * v_~a23~0_479 <= a23 + 577632)) && 260 <= a29) && a3 == 1) && a23 + 43 <= 0)) || ((((((a4 == 1 && a29 <= 245) && 140 < a29) && a23 <= 138) && 15 == a8) && a25 == 11) && a3 == 1)) || ((((a4 == 1 && 15 == a8) && a25 == 11) && (\exists v_prenex_18 : int :: (((0 <= 12 * v_prenex_18 / 10 && 0 <= 12 * v_prenex_18) && 12 * v_prenex_18 / 10 / 5 + 99853 <= a29) && 245 < v_prenex_18) && 0 <= 12 * v_prenex_18 / 10 + 1)) && a3 == 1)) || (((((a4 == 1 && 15 == a8) && a25 == 12) && (\exists v_prenex_49 : int, v_prenex_50 : int :: ((((v_prenex_50 / 5 + 553469 <= a23 && v_prenex_50 + 43 <= 0) && 0 < v_prenex_49 + 43) && 5 * v_prenex_49 <= v_prenex_50 + 577632) && v_prenex_50 < 0) && !(0 == v_prenex_50 % 5))) && a29 <= 220) && a3 == 1)) || ((((a25 == 9 && 312 <= a23) && a4 == 1) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && a4 == 1) && 15 == a8) && 138 < a23) && a3 == 1)) || (((a8 == 15 && a4 == 1) && a25 == 10) && a3 == 1)) || ((a29 <= 140 && a25 == 9) && a4 == 1)) || (((((a25 == 12 && a4 <= 0) && 0 < a23 + 43) && a23 <= 138) && 1 == a3) && 15 == a8)) || ((((a25 == 9 && a4 == 1) && 15 == a8) && a3 == 1) && 245 < a29)) || (((((a25 == 12 && a29 <= 245) && a4 <= 0) && 15 == a8) && a3 == 1) && 0 <= a23 + 599913)) || (((((a25 == 12 && a4 == 1) && 15 == a8) && a23 <= 247) && a3 == 1) && 138 < a23)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((((a4 == 1 && a23 <= 138) && 15 == a8) && a29 <= 140) && a25 == 12) && a3 == 1)) || ((((((a29 <= 140 && a4 <= 0) && !(a25 == 13)) && 0 <= a23 + 599913) && 15 == a8) && a23 + 43 <= 0) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && a4 == 1) && a23 <= 138) && a3 == 1) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:06:12,894 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,895 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,897 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,898 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,899 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,901 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2018-11-06 21:06:12,902 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_479,QUANTIFIED] [2018-11-06 21:06:12,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,903 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2018-11-06 21:06:12,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,904 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2018-11-06 21:06:12,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,905 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] [2018-11-06 21:06:12,906 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_50,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 312 <= a23) && a25 == 11) && 141 <= a29) && a3 == 1) || ((((a25 == 12 && a4 == 1 && a29 <= 245) && 141 <= a29) && 138 < a23) && a3 == 1)) && 15 == a8) || ((((((a4 <= 0 && a23 <= 138) && 15 == a8) && a29 <= 140) && !(a25 == 11)) && 0 < a23 + 43) && a3 == 1)) || (((((a4 <= 0 && 15 == a8) && a25 == 12) && a29 <= 277) && 245 < a29) && a3 == 1) || ((15 == a8 && ((a25 == 9 && a4 <= 0) && (\exists v_prenex_34 : int :: (v_prenex_34 % 299861 + 10250 <= a29 && 0 <= v_prenex_34) && 140 < v_prenex_34)) && a23 + 43 <= 0) && a3 == 1)) || (((((a8 == 15 && a4 == 1) && a23 <= 306) && a25 == 11) && a3 == 1) && 138 < a23)) || (((((((a29 <= 140 && a4 <= 0) && 15 == a8) && a25 == 11) && a23 + 43 <= 0) && a3 == 1) || ((((a29 <= 140 && a4 <= 0) && 15 == a8) && a25 == 10) && a3 == 1)) && 0 <= a23 + 600262)) || (((((a4 == 1 && a25 == 11) && 260 <= a29) && 138 < a23) && 1 == a3) && 15 == a8)) || (((((a25 == 13 && a4 <= 0) && a23 <= 138) && 15 == a8) && 0 < a23 + 43) && a3 == 1)) || ((a25 == 9 && a4 == 1) && a23 + 43 <= 0)) || (((((a25 == 13 && a8 == 15) && ((!(a25 == 9) && a4 == 1) && a29 <= 245) && !(a25 == 10)) && 140 < a29) && a3 == 1) && a23 + 43 <= 0)) || ((((((a4 == 1 && 15 == a8) && 138 < a23) && a25 == 12) && a29 <= 277) && 245 < a29) && a3 == 1) || (((((a4 == 1 && 15 == a8) && a25 == 11) && a29 <= 277) && 245 < a29) && a3 == 1)) || (((140 < a29 && a4 == 1) && a25 == 11) && a23 + 43 <= 0)) || ((((((a4 <= 0 && !(a25 == 13)) && 15 == a8) && (\exists v_~a23~0_479 : int :: 0 < v_~a23~0_479 + 43 && 5 * v_~a23~0_479 <= a23 + 577632)) && 260 <= a29) && a3 == 1) && a23 + 43 <= 0)) || ((((((a4 == 1 && a29 <= 245) && 140 < a29) && a23 <= 138) && 15 == a8) && a25 == 11) && a3 == 1)) || ((((a4 == 1 && 15 == a8) && a25 == 11) && (\exists v_prenex_18 : int :: (((0 <= 12 * v_prenex_18 / 10 && 0 <= 12 * v_prenex_18) && 12 * v_prenex_18 / 10 / 5 + 99853 <= a29) && 245 < v_prenex_18) && 0 <= 12 * v_prenex_18 / 10 + 1)) && a3 == 1)) || (((((a4 == 1 && 15 == a8) && a25 == 12) && (\exists v_prenex_49 : int, v_prenex_50 : int :: ((((v_prenex_50 / 5 + 553469 <= a23 && v_prenex_50 + 43 <= 0) && 0 < v_prenex_49 + 43) && 5 * v_prenex_49 <= v_prenex_50 + 577632) && v_prenex_50 < 0) && !(0 == v_prenex_50 % 5))) && a29 <= 220) && a3 == 1)) || ((((a25 == 9 && 312 <= a23) && a4 == 1) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && a4 == 1) && 15 == a8) && 138 < a23) && a3 == 1)) || (((a8 == 15 && a4 == 1) && a25 == 10) && a3 == 1)) || ((a29 <= 140 && a25 == 9) && a4 == 1)) || (((((a25 == 12 && a4 <= 0) && 0 < a23 + 43) && a23 <= 138) && 1 == a3) && 15 == a8)) || ((((a25 == 9 && a4 == 1) && 15 == a8) && a3 == 1) && 245 < a29)) || (((((a25 == 12 && a29 <= 245) && a4 <= 0) && 15 == a8) && a3 == 1) && 0 <= a23 + 599913)) || (((((a25 == 12 && a4 == 1) && 15 == a8) && a23 <= 247) && a3 == 1) && 138 < a23)) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((((a4 == 1 && a23 <= 138) && 15 == a8) && a29 <= 140) && a25 == 12) && a3 == 1)) || ((((((a29 <= 140 && a4 <= 0) && !(a25 == 13)) && 0 <= a23 + 599913) && 15 == a8) && a23 + 43 <= 0) && a3 == 1)) || ((((a25 == 9 && a8 == 15) && a4 == 1) && a23 <= 138) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 156.9s OverallTime, 25 OverallIterations, 8 TraceHistogramMax, 90.6s AutomataDifference, 0.0s DeadEndRemovalTime, 30.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4975 SDtfs, 18200 SDslu, 2690 SDs, 0 SdLazy, 49559 SolverSat, 7162 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 73.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6251 GetRequests, 6081 SyntacticMatches, 21 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 13.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20664occurred in iteration=10, 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: 3.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 49416 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 306 NumberOfFragments, 1425 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1877117 FormulaSimplificationTreeSizeReduction, 6.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1942364 FormulaSimplificationTreeSizeReductionInter, 24.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 22.3s InterpolantComputationTime, 16215 NumberOfCodeBlocks, 16215 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 16178 ConstructedInterpolants, 456 QuantifiedInterpolants, 41946477 SizeOfPredicates, 27 NumberOfNonLiveVariables, 7838 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 37 InterpolantComputations, 18 PerfectInterpolantSequences, 20438/26020 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...