java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:23:00,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:23:00,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:23:00,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:23:00,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:23:00,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:23:00,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:23:00,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:23:00,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:23:00,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:23:00,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:23:00,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:23:00,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:23:00,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:23:00,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:23:00,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:23:00,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:23:00,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:23:00,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:23:00,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:23:00,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:23:00,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:23:00,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:23:00,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:23:00,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:23:00,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:23:00,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:23:00,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:23:00,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:23:00,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:23:00,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:23:00,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:23:00,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:23:00,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:23:00,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:23:00,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:23:00,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:23:00,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:23:00,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:23:00,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:23:00,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:23:00,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:23:00,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:23:00,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:23:00,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:23:00,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:23:00,978 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:23:00,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:23:00,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:23:00,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:23:00,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:23:00,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:23:00,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:23:00,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:23:00,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:23:00,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:23:00,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:23:00,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:23:00,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:23:00,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:23:00,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:23:00,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:23:00,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:23:00,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:23:00,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:23:00,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:23:00,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:23:00,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:23:00,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:23:00,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:23:00,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:23:01,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:23:01,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:23:01,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:23:01,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:23:01,036 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:23:01,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-10-02 01:23:01,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3442e7b/75355011e4264f71933602508f834f8b/FLAG29b69acdc [2019-10-02 01:23:01,648 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:23:01,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-10-02 01:23:01,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3442e7b/75355011e4264f71933602508f834f8b/FLAG29b69acdc [2019-10-02 01:23:01,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e3442e7b/75355011e4264f71933602508f834f8b [2019-10-02 01:23:01,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:23:01,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:23:01,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:23:01,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:23:01,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:23:01,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:01" (1/1) ... [2019-10-02 01:23:01,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191613fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:01, skipping insertion in model container [2019-10-02 01:23:01,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:01" (1/1) ... [2019-10-02 01:23:01,949 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:23:02,002 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:23:02,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:23:02,679 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:23:02,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:23:02,827 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:23:02,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02 WrapperNode [2019-10-02 01:23:02,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:23:02,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:23:02,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:23:02,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:23:02,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:02,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:02,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:02,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:02,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:02,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:02,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (1/1) ... [2019-10-02 01:23:03,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:23:03,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:23:03,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:23:03,002 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:23:03,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (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 [2019-10-02 01:23:03,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:23:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:23:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:23:03,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:23:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:23:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:23:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:23:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:23:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:23:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:23:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:23:04,582 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:23:04,582 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:23:04,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:04 BoogieIcfgContainer [2019-10-02 01:23:04,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:23:04,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:23:04,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:23:04,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:23:04,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:23:01" (1/3) ... [2019-10-02 01:23:04,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45323431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:04, skipping insertion in model container [2019-10-02 01:23:04,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:02" (2/3) ... [2019-10-02 01:23:04,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45323431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:04, skipping insertion in model container [2019-10-02 01:23:04,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:04" (3/3) ... [2019-10-02 01:23:04,596 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2019-10-02 01:23:04,605 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:23:04,614 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:23:04,632 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:23:04,672 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:23:04,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:23:04,673 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:23:04,673 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:23:04,674 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:23:04,674 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:23:04,674 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:23:04,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:23:04,674 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:23:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 01:23:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 01:23:04,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:04,712 INFO L411 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] [2019-10-02 01:23:04,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:04,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:04,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1020079963, now seen corresponding path program 1 times [2019-10-02 01:23:04,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:04,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:04,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:05,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:05,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:23:05,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:23:05,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:23:05,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:05,054 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-10-02 01:23:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:07,142 INFO L93 Difference]: Finished difference Result 890 states and 1606 transitions. [2019-10-02 01:23:07,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:23:07,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-02 01:23:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:07,179 INFO L225 Difference]: With dead ends: 890 [2019-10-02 01:23:07,179 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 01:23:07,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 01:23:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2019-10-02 01:23:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 01:23:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-10-02 01:23:07,274 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 42 [2019-10-02 01:23:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:07,275 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-10-02 01:23:07,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:23:07,275 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-10-02 01:23:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 01:23:07,282 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:07,282 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:07,282 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:07,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2050989129, now seen corresponding path program 1 times [2019-10-02 01:23:07,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:07,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:07,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:23:07,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:23:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:23:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:07,515 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 4 states. [2019-10-02 01:23:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:09,066 INFO L93 Difference]: Finished difference Result 1466 states and 2091 transitions. [2019-10-02 01:23:09,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:23:09,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-10-02 01:23:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:09,072 INFO L225 Difference]: With dead ends: 1466 [2019-10-02 01:23:09,073 INFO L226 Difference]: Without dead ends: 736 [2019-10-02 01:23:09,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-10-02 01:23:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 554. [2019-10-02 01:23:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 01:23:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 809 transitions. [2019-10-02 01:23:09,115 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 809 transitions. Word has length 125 [2019-10-02 01:23:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:09,116 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 809 transitions. [2019-10-02 01:23:09,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:23:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 809 transitions. [2019-10-02 01:23:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 01:23:09,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:09,120 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:09,120 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:09,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:09,121 INFO L82 PathProgramCache]: Analyzing trace with hash 488627185, now seen corresponding path program 1 times [2019-10-02 01:23:09,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:09,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:09,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:09,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:09,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:09,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:09,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:23:09,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:23:09,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:23:09,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:09,297 INFO L87 Difference]: Start difference. First operand 554 states and 809 transitions. Second operand 4 states. [2019-10-02 01:23:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:10,654 INFO L93 Difference]: Finished difference Result 2194 states and 3264 transitions. [2019-10-02 01:23:10,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:23:10,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-02 01:23:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:10,666 INFO L225 Difference]: With dead ends: 2194 [2019-10-02 01:23:10,666 INFO L226 Difference]: Without dead ends: 1646 [2019-10-02 01:23:10,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-10-02 01:23:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-10-02 01:23:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-10-02 01:23:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2286 transitions. [2019-10-02 01:23:10,758 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2286 transitions. Word has length 137 [2019-10-02 01:23:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:10,759 INFO L475 AbstractCegarLoop]: Abstraction has 1646 states and 2286 transitions. [2019-10-02 01:23:10,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:23:10,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2286 transitions. [2019-10-02 01:23:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 01:23:10,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:10,769 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:23:10,769 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:10,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1957605909, now seen corresponding path program 1 times [2019-10-02 01:23:10,770 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:10,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:10,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:10,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:10,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:10,996 INFO L224 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 [2019-10-02 01:23:11,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:11,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:11,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:11,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:11,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:23:11,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:23:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:23:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:23:11,376 INFO L87 Difference]: Start difference. First operand 1646 states and 2286 transitions. Second operand 9 states. [2019-10-02 01:23:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:14,430 INFO L93 Difference]: Finished difference Result 4888 states and 7260 transitions. [2019-10-02 01:23:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:23:14,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 256 [2019-10-02 01:23:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:14,464 INFO L225 Difference]: With dead ends: 4888 [2019-10-02 01:23:14,464 INFO L226 Difference]: Without dead ends: 2864 [2019-10-02 01:23:14,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:23:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2019-10-02 01:23:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2070. [2019-10-02 01:23:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-10-02 01:23:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2700 transitions. [2019-10-02 01:23:14,652 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2700 transitions. Word has length 256 [2019-10-02 01:23:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:14,653 INFO L475 AbstractCegarLoop]: Abstraction has 2070 states and 2700 transitions. [2019-10-02 01:23:14,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:23:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2700 transitions. [2019-10-02 01:23:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 01:23:14,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:14,663 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:23:14,664 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1276185383, now seen corresponding path program 1 times [2019-10-02 01:23:14,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:14,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 71 proven. 41 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 01:23:15,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:15,173 INFO L224 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) [2019-10-02 01:23:15,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:15,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:15,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 177 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:15,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:23:15,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:23:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:23:15,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:23:15,425 INFO L87 Difference]: Start difference. First operand 2070 states and 2700 transitions. Second operand 9 states. [2019-10-02 01:23:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:16,821 INFO L93 Difference]: Finished difference Result 3932 states and 5191 transitions. [2019-10-02 01:23:16,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 01:23:16,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2019-10-02 01:23:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:16,834 INFO L225 Difference]: With dead ends: 3932 [2019-10-02 01:23:16,834 INFO L226 Difference]: Without dead ends: 2066 [2019-10-02 01:23:16,840 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:23:16,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2019-10-02 01:23:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2040. [2019-10-02 01:23:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2019-10-02 01:23:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2567 transitions. [2019-10-02 01:23:16,904 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2567 transitions. Word has length 270 [2019-10-02 01:23:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:16,905 INFO L475 AbstractCegarLoop]: Abstraction has 2040 states and 2567 transitions. [2019-10-02 01:23:16,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:23:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2567 transitions. [2019-10-02 01:23:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 01:23:16,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:16,912 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:23:16,913 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:16,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:16,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1338425938, now seen corresponding path program 1 times [2019-10-02 01:23:16,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:16,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:16,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:16,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:16,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 144 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:17,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:17,680 INFO L224 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 [2019-10-02 01:23:17,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:17,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:23:17,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:17,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 01:23:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:17,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 01:23:17,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:23:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:23:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:23:17,969 INFO L87 Difference]: Start difference. First operand 2040 states and 2567 transitions. Second operand 15 states. [2019-10-02 01:23:20,948 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-02 01:23:21,573 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 01:23:22,955 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-10-02 01:23:23,205 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-02 01:23:23,370 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-02 01:23:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:26,251 INFO L93 Difference]: Finished difference Result 5070 states and 6342 transitions. [2019-10-02 01:23:26,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 01:23:26,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 273 [2019-10-02 01:23:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:26,266 INFO L225 Difference]: With dead ends: 5070 [2019-10-02 01:23:26,266 INFO L226 Difference]: Without dead ends: 2840 [2019-10-02 01:23:26,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=414, Invalid=2136, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 01:23:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2019-10-02 01:23:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2434. [2019-10-02 01:23:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-10-02 01:23:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2977 transitions. [2019-10-02 01:23:26,341 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2977 transitions. Word has length 273 [2019-10-02 01:23:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:26,342 INFO L475 AbstractCegarLoop]: Abstraction has 2434 states and 2977 transitions. [2019-10-02 01:23:26,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:23:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2977 transitions. [2019-10-02 01:23:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 01:23:26,351 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:26,351 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:26,352 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1103855, now seen corresponding path program 1 times [2019-10-02 01:23:26,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:26,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:26,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:26,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 191 proven. 197 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:23:27,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:27,145 INFO L224 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 [2019-10-02 01:23:27,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:27,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 01:23:27,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:23:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 303 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 01:23:27,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:27,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-10-02 01:23:27,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:23:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:23:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:23:27,623 INFO L87 Difference]: Start difference. First operand 2434 states and 2977 transitions. Second operand 15 states. [2019-10-02 01:23:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:29,908 INFO L93 Difference]: Finished difference Result 4769 states and 5878 transitions. [2019-10-02 01:23:29,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 01:23:29,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 375 [2019-10-02 01:23:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:29,921 INFO L225 Difference]: With dead ends: 4769 [2019-10-02 01:23:29,922 INFO L226 Difference]: Without dead ends: 2660 [2019-10-02 01:23:29,928 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-10-02 01:23:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2019-10-02 01:23:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2434. [2019-10-02 01:23:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-10-02 01:23:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2784 transitions. [2019-10-02 01:23:29,997 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2784 transitions. Word has length 375 [2019-10-02 01:23:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:29,998 INFO L475 AbstractCegarLoop]: Abstraction has 2434 states and 2784 transitions. [2019-10-02 01:23:29,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:23:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2784 transitions. [2019-10-02 01:23:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-02 01:23:30,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:30,010 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:30,010 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash 796559996, now seen corresponding path program 1 times [2019-10-02 01:23:30,011 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:30,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:30,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 334 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 01:23:31,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:31,438 INFO L224 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) [2019-10-02 01:23:31,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:31,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:23:31,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:23:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 01:23:31,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:31,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2019-10-02 01:23:31,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:23:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:23:31,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:23:31,732 INFO L87 Difference]: Start difference. First operand 2434 states and 2784 transitions. Second operand 16 states. [2019-10-02 01:23:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:35,597 INFO L93 Difference]: Finished difference Result 4704 states and 5411 transitions. [2019-10-02 01:23:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 01:23:35,598 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 400 [2019-10-02 01:23:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:35,608 INFO L225 Difference]: With dead ends: 4704 [2019-10-02 01:23:35,608 INFO L226 Difference]: Without dead ends: 2642 [2019-10-02 01:23:35,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=482, Invalid=1680, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 01:23:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2019-10-02 01:23:35,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2444. [2019-10-02 01:23:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-10-02 01:23:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 2712 transitions. [2019-10-02 01:23:35,669 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 2712 transitions. Word has length 400 [2019-10-02 01:23:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:35,670 INFO L475 AbstractCegarLoop]: Abstraction has 2444 states and 2712 transitions. [2019-10-02 01:23:35,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:23:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 2712 transitions. [2019-10-02 01:23:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-10-02 01:23:35,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:35,687 INFO L411 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-10-02 01:23:35,687 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1013279779, now seen corresponding path program 1 times [2019-10-02 01:23:35,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:35,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:35,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:35,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:36,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 297 proven. 607 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 01:23:36,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:36,648 INFO L224 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 [2019-10-02 01:23:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:36,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:23:36,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:36,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:23:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1157 backedges. 599 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-10-02 01:23:37,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:23:37,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:23:37,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:23:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:23:37,302 INFO L87 Difference]: Start difference. First operand 2444 states and 2712 transitions. Second operand 11 states. [2019-10-02 01:23:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:40,826 INFO L93 Difference]: Finished difference Result 5100 states and 5830 transitions. [2019-10-02 01:23:40,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 01:23:40,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 589 [2019-10-02 01:23:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:40,842 INFO L225 Difference]: With dead ends: 5100 [2019-10-02 01:23:40,842 INFO L226 Difference]: Without dead ends: 3028 [2019-10-02 01:23:40,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 608 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 01:23:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2019-10-02 01:23:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2998. [2019-10-02 01:23:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-10-02 01:23:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3278 transitions. [2019-10-02 01:23:40,920 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3278 transitions. Word has length 589 [2019-10-02 01:23:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:40,921 INFO L475 AbstractCegarLoop]: Abstraction has 2998 states and 3278 transitions. [2019-10-02 01:23:40,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:23:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3278 transitions. [2019-10-02 01:23:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2019-10-02 01:23:40,945 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:40,945 INFO L411 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:40,946 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:40,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash -142539850, now seen corresponding path program 1 times [2019-10-02 01:23:40,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:40,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:40,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 527 proven. 119 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-02 01:23:41,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:41,935 INFO L224 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) [2019-10-02 01:23:41,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:42,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:23:42,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 934 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-02 01:23:42,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:42,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 01:23:42,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 01:23:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 01:23:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-02 01:23:42,378 INFO L87 Difference]: Start difference. First operand 2998 states and 3278 transitions. Second operand 7 states. [2019-10-02 01:23:43,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:43,970 INFO L93 Difference]: Finished difference Result 6690 states and 7863 transitions. [2019-10-02 01:23:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 01:23:43,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 676 [2019-10-02 01:23:43,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:43,990 INFO L225 Difference]: With dead ends: 6690 [2019-10-02 01:23:43,990 INFO L226 Difference]: Without dead ends: 4064 [2019-10-02 01:23:43,997 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:23:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2019-10-02 01:23:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 3764. [2019-10-02 01:23:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3764 states. [2019-10-02 01:23:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4214 transitions. [2019-10-02 01:23:44,095 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4214 transitions. Word has length 676 [2019-10-02 01:23:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:44,096 INFO L475 AbstractCegarLoop]: Abstraction has 3764 states and 4214 transitions. [2019-10-02 01:23:44,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 01:23:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4214 transitions. [2019-10-02 01:23:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-10-02 01:23:44,107 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:44,107 INFO L411 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:44,108 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:44,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash 919563926, now seen corresponding path program 1 times [2019-10-02 01:23:44,108 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:44,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:44,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:44,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:44,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 395 proven. 662 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-02 01:23:45,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:45,422 INFO L224 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 [2019-10-02 01:23:45,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:45,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 01:23:45,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:45,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1312 backedges. 952 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:23:46,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:46,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-10-02 01:23:46,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:23:46,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:23:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:23:46,235 INFO L87 Difference]: Start difference. First operand 3764 states and 4214 transitions. Second operand 15 states. [2019-10-02 01:23:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:50,815 INFO L93 Difference]: Finished difference Result 8328 states and 9420 transitions. [2019-10-02 01:23:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 01:23:50,816 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 692 [2019-10-02 01:23:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:50,833 INFO L225 Difference]: With dead ends: 8328 [2019-10-02 01:23:50,833 INFO L226 Difference]: Without dead ends: 4564 [2019-10-02 01:23:50,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=452, Invalid=1804, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 01:23:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-10-02 01:23:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4546. [2019-10-02 01:23:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4546 states. [2019-10-02 01:23:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 5034 transitions. [2019-10-02 01:23:50,934 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 5034 transitions. Word has length 692 [2019-10-02 01:23:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:50,935 INFO L475 AbstractCegarLoop]: Abstraction has 4546 states and 5034 transitions. [2019-10-02 01:23:50,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:23:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 5034 transitions. [2019-10-02 01:23:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2019-10-02 01:23:50,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:50,948 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 4, 3, 3, 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] [2019-10-02 01:23:50,948 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash 70879184, now seen corresponding path program 1 times [2019-10-02 01:23:50,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:50,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:50,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:50,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 545 proven. 777 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-10-02 01:23:52,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:52,292 INFO L224 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 [2019-10-02 01:23:52,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:52,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 01:23:52,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:52,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:23:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1739 backedges. 1275 proven. 2 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2019-10-02 01:23:52,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:52,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-10-02 01:23:52,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:23:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:23:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:23:52,946 INFO L87 Difference]: Start difference. First operand 4546 states and 5034 transitions. Second operand 13 states. [2019-10-02 01:23:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:54,798 INFO L93 Difference]: Finished difference Result 8871 states and 10060 transitions. [2019-10-02 01:23:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:23:54,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 707 [2019-10-02 01:23:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:54,834 INFO L225 Difference]: With dead ends: 8871 [2019-10-02 01:23:54,834 INFO L226 Difference]: Without dead ends: 4840 [2019-10-02 01:23:54,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:23:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4840 states. [2019-10-02 01:23:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4840 to 4532. [2019-10-02 01:23:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4532 states. [2019-10-02 01:23:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 4900 transitions. [2019-10-02 01:23:54,944 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 4900 transitions. Word has length 707 [2019-10-02 01:23:54,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:54,945 INFO L475 AbstractCegarLoop]: Abstraction has 4532 states and 4900 transitions. [2019-10-02 01:23:54,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:23:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 4900 transitions. [2019-10-02 01:23:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2019-10-02 01:23:54,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:54,960 INFO L411 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, 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, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:54,960 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:54,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1234661610, now seen corresponding path program 1 times [2019-10-02 01:23:54,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:54,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:54,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2341 backedges. 693 proven. 1062 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-10-02 01:23:56,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:56,355 INFO L224 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 [2019-10-02 01:23:56,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:56,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:23:56,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:56,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2341 backedges. 1566 proven. 2 refuted. 0 times theorem prover too weak. 773 trivial. 0 not checked. [2019-10-02 01:23:56,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:56,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-10-02 01:23:56,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 01:23:56,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 01:23:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:23:56,966 INFO L87 Difference]: Start difference. First operand 4532 states and 4900 transitions. Second operand 19 states. [2019-10-02 01:24:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:01,385 INFO L93 Difference]: Finished difference Result 8883 states and 9818 transitions. [2019-10-02 01:24:01,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 01:24:01,386 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 806 [2019-10-02 01:24:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:01,402 INFO L225 Difference]: With dead ends: 8883 [2019-10-02 01:24:01,402 INFO L226 Difference]: Without dead ends: 4649 [2019-10-02 01:24:01,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 825 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=594, Invalid=2268, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 01:24:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2019-10-02 01:24:01,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4130. [2019-10-02 01:24:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4130 states. [2019-10-02 01:24:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 4380 transitions. [2019-10-02 01:24:01,496 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 4380 transitions. Word has length 806 [2019-10-02 01:24:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:01,497 INFO L475 AbstractCegarLoop]: Abstraction has 4130 states and 4380 transitions. [2019-10-02 01:24:01,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 01:24:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 4380 transitions. [2019-10-02 01:24:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2019-10-02 01:24:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:01,512 INFO L411 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:24:01,513 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 733851430, now seen corresponding path program 1 times [2019-10-02 01:24:01,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:01,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:01,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:01,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 771 proven. 841 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 01:24:04,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:04,153 INFO L224 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 [2019-10-02 01:24:04,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:04,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:24:04,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:04,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1943 backedges. 1250 proven. 2 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2019-10-02 01:24:04,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:04,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-10-02 01:24:04,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 01:24:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 01:24:04,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:24:04,808 INFO L87 Difference]: Start difference. First operand 4130 states and 4380 transitions. Second operand 20 states. [2019-10-02 01:24:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:11,390 INFO L93 Difference]: Finished difference Result 8620 states and 9175 transitions. [2019-10-02 01:24:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 01:24:11,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 835 [2019-10-02 01:24:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:11,403 INFO L225 Difference]: With dead ends: 8620 [2019-10-02 01:24:11,403 INFO L226 Difference]: Without dead ends: 4492 [2019-10-02 01:24:11,414 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 871 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1263 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=721, Invalid=3701, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 01:24:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4492 states. [2019-10-02 01:24:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4492 to 3720. [2019-10-02 01:24:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-10-02 01:24:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 3852 transitions. [2019-10-02 01:24:11,479 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 3852 transitions. Word has length 835 [2019-10-02 01:24:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:11,480 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 3852 transitions. [2019-10-02 01:24:11,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 01:24:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 3852 transitions. [2019-10-02 01:24:11,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2019-10-02 01:24:11,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:11,504 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:11,504 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:11,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:11,505 INFO L82 PathProgramCache]: Analyzing trace with hash -52968781, now seen corresponding path program 1 times [2019-10-02 01:24:11,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:11,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:11,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:11,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3272 backedges. 665 proven. 1509 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2019-10-02 01:24:14,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:14,373 INFO L224 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 [2019-10-02 01:24:14,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:14,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1469 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:24:14,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3272 backedges. 2211 proven. 2 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2019-10-02 01:24:15,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:15,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:24:15,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:24:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:24:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:24:15,111 INFO L87 Difference]: Start difference. First operand 3720 states and 3852 transitions. Second operand 18 states. [2019-10-02 01:24:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:20,000 INFO L93 Difference]: Finished difference Result 7466 states and 7772 transitions. [2019-10-02 01:24:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 01:24:20,000 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1056 [2019-10-02 01:24:20,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:20,010 INFO L225 Difference]: With dead ends: 7466 [2019-10-02 01:24:20,011 INFO L226 Difference]: Without dead ends: 3752 [2019-10-02 01:24:20,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1125 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 01:24:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-10-02 01:24:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3712. [2019-10-02 01:24:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2019-10-02 01:24:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 3828 transitions. [2019-10-02 01:24:20,082 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 3828 transitions. Word has length 1056 [2019-10-02 01:24:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:20,082 INFO L475 AbstractCegarLoop]: Abstraction has 3712 states and 3828 transitions. [2019-10-02 01:24:20,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:24:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 3828 transitions. [2019-10-02 01:24:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2019-10-02 01:24:20,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:20,111 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:20,112 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:20,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1908903455, now seen corresponding path program 1 times [2019-10-02 01:24:20,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:20,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:20,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 1490 proven. 2115 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-10-02 01:24:24,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:24,588 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:24,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:24,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 01:24:24,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:24,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:24,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 2434 proven. 6 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-10-02 01:24:25,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:25,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 38 [2019-10-02 01:24:25,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 01:24:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 01:24:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 01:24:25,764 INFO L87 Difference]: Start difference. First operand 3712 states and 3828 transitions. Second operand 38 states. [2019-10-02 01:24:28,788 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-10-02 01:24:28,959 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 01:24:30,620 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-10-02 01:24:30,771 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2019-10-02 01:24:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:39,210 INFO L93 Difference]: Finished difference Result 8053 states and 8485 transitions. [2019-10-02 01:24:39,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 01:24:39,210 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1137 [2019-10-02 01:24:39,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:39,223 INFO L225 Difference]: With dead ends: 8053 [2019-10-02 01:24:39,223 INFO L226 Difference]: Without dead ends: 4531 [2019-10-02 01:24:39,233 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 1168 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2638 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1622, Invalid=7884, Unknown=0, NotChecked=0, Total=9506 [2019-10-02 01:24:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2019-10-02 01:24:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 3896. [2019-10-02 01:24:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-10-02 01:24:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 4006 transitions. [2019-10-02 01:24:39,314 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 4006 transitions. Word has length 1137 [2019-10-02 01:24:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:39,316 INFO L475 AbstractCegarLoop]: Abstraction has 3896 states and 4006 transitions. [2019-10-02 01:24:39,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 01:24:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 4006 transitions. [2019-10-02 01:24:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1691 [2019-10-02 01:24:39,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:39,357 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-10-02 01:24:39,358 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:39,359 INFO L82 PathProgramCache]: Analyzing trace with hash 245384140, now seen corresponding path program 1 times [2019-10-02 01:24:39,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:39,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:39,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:39,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8825 backedges. 2058 proven. 5369 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2019-10-02 01:24:45,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:45,639 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:45,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:46,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 2291 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 01:24:46,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:46,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8825 backedges. 2841 proven. 82 refuted. 0 times theorem prover too weak. 5902 trivial. 0 not checked. [2019-10-02 01:24:47,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:47,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 8] total 36 [2019-10-02 01:24:47,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 01:24:47,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 01:24:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 01:24:47,605 INFO L87 Difference]: Start difference. First operand 3896 states and 4006 transitions. Second operand 36 states. [2019-10-02 01:24:51,032 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-02 01:24:53,993 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-02 01:24:54,895 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-02 01:25:05,001 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-10-02 01:25:07,698 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-02 01:25:10,936 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-02 01:25:12,527 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-10-02 01:25:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:16,040 INFO L93 Difference]: Finished difference Result 9809 states and 10302 transitions. [2019-10-02 01:25:16,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-10-02 01:25:16,041 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1690 [2019-10-02 01:25:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:16,060 INFO L225 Difference]: With dead ends: 9809 [2019-10-02 01:25:16,060 INFO L226 Difference]: Without dead ends: 5727 [2019-10-02 01:25:16,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1912 GetRequests, 1740 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10559 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=4007, Invalid=25749, Unknown=0, NotChecked=0, Total=29756 [2019-10-02 01:25:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5727 states. [2019-10-02 01:25:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5727 to 4820. [2019-10-02 01:25:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4820 states. [2019-10-02 01:25:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 4923 transitions. [2019-10-02 01:25:16,167 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 4923 transitions. Word has length 1690 [2019-10-02 01:25:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:16,169 INFO L475 AbstractCegarLoop]: Abstraction has 4820 states and 4923 transitions. [2019-10-02 01:25:16,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 01:25:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 4923 transitions. [2019-10-02 01:25:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1943 [2019-10-02 01:25:16,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:16,216 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 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, 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] [2019-10-02 01:25:16,217 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:16,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1961048688, now seen corresponding path program 1 times [2019-10-02 01:25:16,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:16,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:16,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:16,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:16,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11966 backedges. 2907 proven. 6952 refuted. 0 times theorem prover too weak. 2107 trivial. 0 not checked. [2019-10-02 01:25:24,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:24,631 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:25:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:25,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:25:25,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:25,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:25:25,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:25:28,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:25:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11966 backedges. 5770 proven. 12 refuted. 0 times theorem prover too weak. 6184 trivial. 0 not checked. [2019-10-02 01:25:29,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:29,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 9] total 42 [2019-10-02 01:25:29,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 01:25:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 01:25:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1561, Unknown=1, NotChecked=0, Total=1722 [2019-10-02 01:25:29,903 INFO L87 Difference]: Start difference. First operand 4820 states and 4923 transitions. Second operand 42 states. [2019-10-02 01:25:33,381 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-10-02 01:25:33,614 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2019-10-02 01:25:35,672 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2019-10-02 01:25:52,067 WARN L191 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-02 01:25:54,986 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-10-02 01:25:58,825 WARN L191 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-10-02 01:26:03,485 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-10-02 01:26:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:13,503 INFO L93 Difference]: Finished difference Result 11567 states and 12225 transitions. [2019-10-02 01:26:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-10-02 01:26:13,504 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1942 [2019-10-02 01:26:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:13,525 INFO L225 Difference]: With dead ends: 11567 [2019-10-02 01:26:13,525 INFO L226 Difference]: Without dead ends: 6545 [2019-10-02 01:26:13,538 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2199 GetRequests, 1991 SyntacticMatches, 4 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15326 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=4964, Invalid=37265, Unknown=1, NotChecked=0, Total=42230 [2019-10-02 01:26:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6545 states. [2019-10-02 01:26:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6545 to 4820. [2019-10-02 01:26:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4820 states. [2019-10-02 01:26:13,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 4891 transitions. [2019-10-02 01:26:13,649 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 4891 transitions. Word has length 1942 [2019-10-02 01:26:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:13,650 INFO L475 AbstractCegarLoop]: Abstraction has 4820 states and 4891 transitions. [2019-10-02 01:26:13,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 01:26:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 4891 transitions. [2019-10-02 01:26:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2201 [2019-10-02 01:26:13,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:13,707 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 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, 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] [2019-10-02 01:26:13,707 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:13,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1114158568, now seen corresponding path program 1 times [2019-10-02 01:26:13,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:13,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:13,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:13,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:13,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15194 backedges. 6664 proven. 2405 refuted. 0 times theorem prover too weak. 6125 trivial. 0 not checked. [2019-10-02 01:26:17,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:17,301 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:17,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:17,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 2953 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:26:17,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15194 backedges. 5616 proven. 2 refuted. 0 times theorem prover too weak. 9576 trivial. 0 not checked. [2019-10-02 01:26:19,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:19,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 01:26:19,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 01:26:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 01:26:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:26:19,581 INFO L87 Difference]: Start difference. First operand 4820 states and 4891 transitions. Second operand 10 states. [2019-10-02 01:26:21,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:21,333 INFO L93 Difference]: Finished difference Result 9074 states and 9204 transitions. [2019-10-02 01:26:21,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 01:26:21,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2200 [2019-10-02 01:26:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:21,344 INFO L225 Difference]: With dead ends: 9074 [2019-10-02 01:26:21,344 INFO L226 Difference]: Without dead ends: 4444 [2019-10-02 01:26:21,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2233 GetRequests, 2217 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:26:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2019-10-02 01:26:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 3890. [2019-10-02 01:26:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2019-10-02 01:26:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 3929 transitions. [2019-10-02 01:26:21,418 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 3929 transitions. Word has length 2200 [2019-10-02 01:26:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:21,421 INFO L475 AbstractCegarLoop]: Abstraction has 3890 states and 3929 transitions. [2019-10-02 01:26:21,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 01:26:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 3929 transitions. [2019-10-02 01:26:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2425 [2019-10-02 01:26:21,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:21,483 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 14, 14, 14, 13, 13, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 7, 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, 4, 4, 4, 4, 4, 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] [2019-10-02 01:26:21,484 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:21,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:21,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1529888679, now seen corresponding path program 1 times [2019-10-02 01:26:21,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:21,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:21,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:21,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:21,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18021 backedges. 3329 proven. 9258 refuted. 0 times theorem prover too weak. 5434 trivial. 0 not checked. [2019-10-02 01:26:30,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:30,581 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:30,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:31,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 3211 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 01:26:31,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:31,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18021 backedges. 2554 proven. 38 refuted. 0 times theorem prover too weak. 15429 trivial. 0 not checked. [2019-10-02 01:26:33,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:33,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 6] total 32 [2019-10-02 01:26:33,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 01:26:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 01:26:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-10-02 01:26:33,325 INFO L87 Difference]: Start difference. First operand 3890 states and 3929 transitions. Second operand 32 states. [2019-10-02 01:26:36,482 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-02 01:26:39,310 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-02 01:26:50,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:50,938 INFO L93 Difference]: Finished difference Result 5767 states and 5882 transitions. [2019-10-02 01:26:50,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-02 01:26:50,938 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2424 [2019-10-02 01:26:50,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:50,941 INFO L225 Difference]: With dead ends: 5767 [2019-10-02 01:26:50,942 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:26:50,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2563 GetRequests, 2453 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3586 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1789, Invalid=10201, Unknown=0, NotChecked=0, Total=11990 [2019-10-02 01:26:50,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:26:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:26:50,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:26:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:26:50,951 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2424 [2019-10-02 01:26:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:50,952 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:26:50,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 01:26:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:26:50,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:26:50,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:26:51,268 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2019-10-02 01:26:54,395 WARN L191 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 907 DAG size of output: 732 [2019-10-02 01:26:56,404 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 907 DAG size of output: 732 [2019-10-02 01:26:56,559 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 32 [2019-10-02 01:27:01,722 WARN L191 SmtUtils]: Spent 5.13 s on a formula simplification. DAG size of input: 613 DAG size of output: 190 [2019-10-02 01:27:09,292 WARN L191 SmtUtils]: Spent 7.54 s on a formula simplification. DAG size of input: 686 DAG size of output: 173 [2019-10-02 01:27:16,574 WARN L191 SmtUtils]: Spent 7.28 s on a formula simplification. DAG size of input: 686 DAG size of output: 173 [2019-10-02 01:27:16,577 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:27:16,577 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:27:16,577 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:27:16,577 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-10-02 01:27:16,578 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-10-02 01:27:16,579 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,580 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-10-02 01:27:16,581 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:27:16,582 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:27:16,583 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,584 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-10-02 01:27:16,585 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-10-02 01:27:16,586 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:27:16,587 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-10-02 01:27:16,588 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse44 (+ |old(~a12~0)| 43))) (let ((.cse28 (= 7 |old(~a15~0)|)) (.cse24 (= 7 |old(~a21~0)|)) (.cse37 (not (<= .cse44 0)))) (let ((.cse23 (= 5 |old(~a15~0)|)) (.cse31 (let ((.cse45 (not (<= |old(~a15~0)| 7)))) (and (or .cse28 .cse45) (or .cse24 .cse45 .cse37)))) (.cse43 (= 1 |old(~a24~0)|)) (.cse35 (= 10 |old(~a21~0)|))) (let ((.cse19 (not .cse35)) (.cse6 (not .cse43)) (.cse36 (not (< 80 |old(~a12~0)|))) (.cse21 (or (and .cse43 (not (< 0 .cse44)) .cse23 .cse24) .cse31)) (.cse10 (<= ~a12~0 |old(~a12~0)|)) (.cse11 (<= |old(~a12~0)| ~a12~0))) (let ((.cse1 (= ~a24~0 |old(~a24~0)|)) (.cse0 (and .cse10 .cse11)) (.cse34 (and (or .cse19 .cse28 .cse6 .cse36) (or .cse21 .cse35))) (.cse13 (= ~a24~0 1)) (.cse2 (= ~a21~0 |old(~a21~0)|)) (.cse3 (= ~a15~0 |old(~a15~0)|)) (.cse39 (= ~a12~0 |old(~a12~0)|)) (.cse38 (not (= ~a21~0 7))) (.cse33 (= 6 |old(~a21~0)|)) (.cse41 (= 9 |old(~a21~0)|))) (let ((.cse15 (= ~a15~0 9)) (.cse7 (not .cse41)) (.cse12 (= ~a21~0 9)) (.cse17 (not (<= 82 |old(~a12~0)|))) (.cse4 (not (= 9 |old(~a15~0)|))) (.cse5 (not .cse33)) (.cse20 (and .cse39 (let ((.cse42 (<= ~a15~0 7))) (or (and .cse42 (<= (+ ~a12~0 43) 0) .cse38) (and .cse42 (not (= ~a15~0 7))))))) (.cse22 (and (and .cse10 .cse11 .cse13) .cse2 .cse3)) (.cse30 (not (<= |old(~a12~0)| 11))) (.cse29 (not (<= |old(~a15~0)| 8))) (.cse18 (let ((.cse40 (and (or .cse34 .cse6) (or .cse34 .cse37)))) (and (or .cse40 .cse41) (or .cse40 .cse6)))) (.cse25 (and .cse1 .cse0 .cse2 .cse3)) (.cse32 (and .cse39 .cse1 .cse2 .cse3)) (.cse26 (not .cse28)) (.cse14 (not (<= |old(~a12~0)| 10))) (.cse8 (not (<= 19 |old(~a12~0)|))) (.cse9 (not (= 8 |old(~a15~0)|))) (.cse16 (not (= 8 |old(~a21~0)|))) (.cse27 (and .cse10 .cse11 .cse2 .cse3 .cse13))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (or .cse5 (not (<= |old(~a12~0)| 95434)) (not (< 95380 |old(~a12~0)|))) .cse6) (or (or .cse7 (not (<= |old(~a12~0)| 75))) .cse8 .cse6 .cse9 (and .cse10 .cse11 .cse12 .cse3 .cse13)) (or .cse4 .cse6 .cse14 (and .cse10 .cse11 .cse2 .cse13 .cse15) .cse16) (or .cse7 .cse4 .cse6 (and .cse10 .cse11 .cse12 .cse13 .cse15) .cse17) (or .cse18 .cse4 (and (and .cse10 .cse11 .cse1 (= ~a21~0 10)) .cse3) .cse17) (or .cse19 (and (and .cse20 .cse1) .cse2 .cse3) .cse21) (or .cse22 (or (not (<= |old(~a12~0)| 72)) .cse4 .cse6 (not (< 18 |old(~a12~0)|))) .cse16) (or .cse5 .cse6 (not .cse23) (and .cse20 .cse1 .cse2 .cse3)) (or (and (or .cse4 .cse16) (or .cse4 (not .cse24))) .cse6 .cse25 .cse17) (or (= ~a21~0 6) .cse5 .cse26) (or (or .cse7 .cse14) .cse6 .cse9 (and (and .cse10 .cse11 .cse12) .cse1 .cse3)) (or .cse27 .cse17 .cse16 .cse28 .cse6 (not (<= |old(~a12~0)| 73281)) .cse29) (or (and (and .cse10 .cse11 .cse2 .cse13) .cse3) .cse4 (or .cse19 .cse6 .cse30)) (or .cse27 .cse5 .cse6 .cse9 (not (<= 286349 |old(~a12~0)|))) (or (not (= 6 |old(~a15~0)|)) (= ~a15~0 6)) (or .cse31 .cse32 (not (<= (+ |old(~a12~0)| 49) 0))) (or .cse33 (and .cse1 .cse2 .cse3 .cse20) .cse34 .cse35) (or .cse22 (or .cse19 .cse30) .cse6 .cse9) (or .cse19 .cse27 .cse28 .cse6 .cse36 .cse29) (or .cse18 .cse37 .cse25) (or (and .cse3 .cse38) .cse24 .cse26) (or .cse32 .cse26 (not (<= (+ |old(~a12~0)| 340660) 0))) (or (or (or .cse33 (not (<= |old(~a21~0)| 7))) .cse14) .cse27 .cse6 .cse9) (or .cse8 (not (<= |old(~a12~0)| 76)) .cse9 .cse16 .cse27 .cse6)))))))) [2019-10-02 01:27:16,588 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-10-02 01:27:16,588 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-10-02 01:27:16,589 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:27:16,590 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:27:16,591 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-10-02 01:27:16,592 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-10-02 01:27:16,593 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,594 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,595 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,596 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,597 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,598 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-10-02 01:27:16,599 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-10-02 01:27:16,600 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:27:16,601 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-10-02 01:27:16,602 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:27:16,603 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:27:16,604 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:27:16,604 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-10-02 01:27:16,604 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:27:16,604 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a21~0 7) (<= 7 ~a21~0) (= ~a15~0 8) (= ~a24~0 1) (<= (+ ~a12~0 49) 0)) [2019-10-02 01:27:16,604 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:27:16,604 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:27:16,604 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (not (<= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a15~0 |old(~a15~0)|) (<= |old(~a21~0)| ~a21~0) (<= ~a21~0 7) (= ~a24~0 1)) (not (<= |old(~a21~0)| 7))) [2019-10-02 01:27:16,605 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:27:16,605 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse24 (= ~a15~0 7)) (.cse25 (= ~a21~0 7)) (.cse21 (= ~a15~0 5))) (let ((.cse11 (= ~a21~0 10)) (.cse35 (not .cse21)) (.cse5 (= ~a24~0 1)) (.cse37 (+ ~a12~0 43)) (.cse26 (not .cse25)) (.cse32 (or (not (= 9 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)))) (.cse8 (and (<= ~a15~0 7) (not .cse24))) (.cse38 (not (= 6 |old(~a21~0)|))) (.cse39 (not (= 5 |old(~a15~0)|))) (.cse33 (or (and (<= |old(~a21~0)| 10) (<= |old(~a12~0)| 80)) (<= |old(~a21~0)| 6)))) (let ((.cse34 (not (= 10 |old(~a21~0)|))) (.cse17 (and (or .cse35 (not .cse5) (< 0 .cse37) .cse26) (and .cse32 (and .cse8 (or .cse38 (<= 0 (+ |old(~a12~0)| 42)) .cse39))) .cse33)) (.cse36 (not .cse11))) (let ((.cse22 (and .cse34 .cse17 .cse36)) (.cse31 (or .cse38 .cse39))) (let ((.cse6 (= ~a21~0 9)) (.cse23 (<= .cse37 0)) (.cse4 (not (= 8 |old(~a15~0)|))) (.cse16 (and .cse22 .cse31)) (.cse20 (< 80 ~a12~0)) (.cse1 (= ~a24~0 |old(~a24~0)|)) (.cse19 (and (<= ~a15~0 8) .cse26)) (.cse15 (= ~a21~0 6))) (let ((.cse12 (<= ~a12~0 11)) (.cse9 (<= ~a12~0 10)) (.cse10 (= ~a15~0 |old(~a15~0)|)) (.cse14 (not .cse15)) (.cse13 (and (and .cse35 .cse19 .cse33) .cse36)) (.cse0 (<= 19 ~a12~0)) (.cse18 (let ((.cse27 (or (not (= 6 |old(~a15~0)|)) (not (= 8 |old(~a21~0)|)))) (.cse28 (let ((.cse29 (or .cse16 (and .cse31 (and (and .cse32 .cse33 .cse20) .cse34 .cse11) .cse1))) (.cse30 (or (not (= 9 |old(~a21~0)|)) .cse4 (<= 12 |old(~a12~0)|)))) (or (and .cse29 .cse30 .cse5) (and .cse23 .cse29 .cse30))))) (or (and .cse27 .cse28 .cse5) (and (not .cse6) .cse27 .cse28)))) (.cse2 (= ~a21~0 8)) (.cse3 (= ~a15~0 9)) (.cse7 (<= 82 ~a12~0))) (or (and (and (<= ~a12~0 72) .cse0) .cse1 .cse2 .cse3) .cse4 (and (and .cse5 .cse6) .cse3 .cse7) (and .cse8 (<= (+ ~a12~0 49) 0)) (and (and .cse6 .cse9) .cse1 .cse10) (and .cse1 (and .cse11 .cse12) .cse3) (and (and (and (<= ~a12~0 76) .cse13 .cse2) .cse1) .cse0) (and .cse2 .cse9 .cse5 .cse3) (and .cse12 .cse1 .cse11 .cse10) (and (and (and .cse14 (<= ~a21~0 7)) .cse9) .cse1 .cse10) (and (<= ~a12~0 73281) .cse5 (and .cse13 .cse2) .cse7) (and (<= 286349 ~a12~0) (and (= ~a15~0 8) .cse15 .cse5)) (not (<= (+ |old(~a12~0)| 49) 0)) (and .cse14 .cse16) (and .cse17 .cse11) (and .cse18 .cse3 .cse7) (and (and (and .cse19 .cse20) .cse11) .cse5) (not (<= |old(~a21~0)| 7)) (and (and (and .cse13 .cse6) (<= ~a12~0 75) .cse0) .cse1) (and (and (<= ~a12~0 95434) .cse15 (< 95380 ~a12~0)) .cse1 .cse3) (and .cse1 .cse21 .cse22) (not (<= 7 |old(~a21~0)|)) (and .cse23 .cse18) (and .cse24 (<= (+ ~a12~0 340660) 0)) (and (or .cse2 .cse25) .cse5 .cse3 .cse7) (not (= 1 |old(~a24~0)|)) (and .cse24 .cse26) (= ~a15~0 6)))))))) [2019-10-02 01:27:16,605 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-02 01:27:16,605 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-10-02 01:27:16,606 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse24 (= ~a15~0 7)) (.cse25 (= ~a21~0 7)) (.cse21 (= ~a15~0 5))) (let ((.cse11 (= ~a21~0 10)) (.cse35 (not .cse21)) (.cse5 (= ~a24~0 1)) (.cse37 (+ ~a12~0 43)) (.cse26 (not .cse25)) (.cse32 (or (not (= 9 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)))) (.cse8 (and (<= ~a15~0 7) (not .cse24))) (.cse38 (not (= 6 |old(~a21~0)|))) (.cse39 (not (= 5 |old(~a15~0)|))) (.cse33 (or (and (<= |old(~a21~0)| 10) (<= |old(~a12~0)| 80)) (<= |old(~a21~0)| 6)))) (let ((.cse34 (not (= 10 |old(~a21~0)|))) (.cse17 (and (or .cse35 (not .cse5) (< 0 .cse37) .cse26) (and .cse32 (and .cse8 (or .cse38 (<= 0 (+ |old(~a12~0)| 42)) .cse39))) .cse33)) (.cse36 (not .cse11))) (let ((.cse22 (and .cse34 .cse17 .cse36)) (.cse31 (or .cse38 .cse39))) (let ((.cse6 (= ~a21~0 9)) (.cse23 (<= .cse37 0)) (.cse4 (not (= 8 |old(~a15~0)|))) (.cse16 (and .cse22 .cse31)) (.cse20 (< 80 ~a12~0)) (.cse1 (= ~a24~0 |old(~a24~0)|)) (.cse19 (and (<= ~a15~0 8) .cse26)) (.cse15 (= ~a21~0 6))) (let ((.cse12 (<= ~a12~0 11)) (.cse9 (<= ~a12~0 10)) (.cse10 (= ~a15~0 |old(~a15~0)|)) (.cse14 (not .cse15)) (.cse13 (and (and .cse35 .cse19 .cse33) .cse36)) (.cse0 (<= 19 ~a12~0)) (.cse18 (let ((.cse27 (or (not (= 6 |old(~a15~0)|)) (not (= 8 |old(~a21~0)|)))) (.cse28 (let ((.cse29 (or .cse16 (and .cse31 (and (and .cse32 .cse33 .cse20) .cse34 .cse11) .cse1))) (.cse30 (or (not (= 9 |old(~a21~0)|)) .cse4 (<= 12 |old(~a12~0)|)))) (or (and .cse29 .cse30 .cse5) (and .cse23 .cse29 .cse30))))) (or (and .cse27 .cse28 .cse5) (and (not .cse6) .cse27 .cse28)))) (.cse2 (= ~a21~0 8)) (.cse3 (= ~a15~0 9)) (.cse7 (<= 82 ~a12~0))) (or (and (and (<= ~a12~0 72) .cse0) .cse1 .cse2 .cse3) .cse4 (and (and .cse5 .cse6) .cse3 .cse7) (and .cse8 (<= (+ ~a12~0 49) 0)) (and (and .cse6 .cse9) .cse1 .cse10) (and .cse1 (and .cse11 .cse12) .cse3) (and (and (and (<= ~a12~0 76) .cse13 .cse2) .cse1) .cse0) (and .cse2 .cse9 .cse5 .cse3) (and .cse12 .cse1 .cse11 .cse10) (and (and (and .cse14 (<= ~a21~0 7)) .cse9) .cse1 .cse10) (and (<= ~a12~0 73281) .cse5 (and .cse13 .cse2) .cse7) (and (<= 286349 ~a12~0) (and (= ~a15~0 8) .cse15 .cse5)) (not (<= (+ |old(~a12~0)| 49) 0)) (and .cse14 .cse16) (and .cse17 .cse11) (and .cse18 .cse3 .cse7) (and (and (and .cse19 .cse20) .cse11) .cse5) (not (<= |old(~a21~0)| 7)) (and (and (and .cse13 .cse6) (<= ~a12~0 75) .cse0) .cse1) (and (and (<= ~a12~0 95434) .cse15 (< 95380 ~a12~0)) .cse1 .cse3) (and .cse1 .cse21 .cse22) (not (<= 7 |old(~a21~0)|)) (and .cse23 .cse18) (and .cse24 (<= (+ ~a12~0 340660) 0)) (and (or .cse2 .cse25) .cse5 .cse3 .cse7) (not (= 1 |old(~a24~0)|)) (and .cse24 .cse26) (= ~a15~0 6)))))))) [2019-10-02 01:27:16,606 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:27:16,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:27:16 BoogieIcfgContainer [2019-10-02 01:27:16,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:27:16,660 INFO L168 Benchmark]: Toolchain (without parser) took 254732.05 ms. Allocated memory was 133.7 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 87.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:27:16,661 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:27:16,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.35 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 87.4 MB in the beginning and 153.0 MB in the end (delta: -65.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-10-02 01:27:16,662 INFO L168 Benchmark]: Boogie Preprocessor took 172.69 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 147.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-10-02 01:27:16,663 INFO L168 Benchmark]: RCFGBuilder took 1582.87 ms. Allocated memory was 201.3 MB in the beginning and 227.0 MB in the end (delta: 25.7 MB). Free memory was 147.4 MB in the beginning and 140.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. [2019-10-02 01:27:16,664 INFO L168 Benchmark]: TraceAbstraction took 252072.02 ms. Allocated memory was 227.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 140.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:27:16,668 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 898.35 ms. Allocated memory was 133.7 MB in the beginning and 201.3 MB in the end (delta: 67.6 MB). Free memory was 87.4 MB in the beginning and 153.0 MB in the end (delta: -65.6 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 172.69 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 147.4 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1582.87 ms. Allocated memory was 201.3 MB in the beginning and 227.0 MB in the end (delta: 25.7 MB). Free memory was 147.4 MB in the beginning and 140.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 77.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252072.02 ms. Allocated memory was 227.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 140.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 112]: 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: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a12 <= 72 && 19 <= a12) && a24 == \old(a24)) && a21 == 8) && a15 == 9) || !(8 == \old(a15))) || (((a24 == 1 && a21 == 9) && a15 == 9) && 82 <= a12)) || ((a15 <= 7 && !(a15 == 7)) && a12 + 49 <= 0)) || (((a21 == 9 && a12 <= 10) && a24 == \old(a24)) && a15 == \old(a15))) || ((a24 == \old(a24) && a21 == 10 && a12 <= 11) && a15 == 9)) || ((((a12 <= 76 && ((!(a15 == 5) && a15 <= 8 && !(a21 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && a21 == 8) && a24 == \old(a24)) && 19 <= a12)) || (((a21 == 8 && a12 <= 10) && a24 == 1) && a15 == 9)) || (((a12 <= 11 && a24 == \old(a24)) && a21 == 10) && a15 == \old(a15))) || ((((!(a21 == 6) && a21 <= 7) && a12 <= 10) && a24 == \old(a24)) && a15 == \old(a15))) || (((a12 <= 73281 && a24 == 1) && (((!(a15 == 5) && a15 <= 8 && !(a21 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && a21 == 8) && 82 <= a12)) || (286349 <= a12 && (a15 == 8 && a21 == 6) && a24 == 1)) || !(\old(a12) + 49 <= 0)) || (!(a21 == 6) && ((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15))))) || ((((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && a21 == 10)) || ((((((!(6 == \old(a15)) || !(8 == \old(a21))) && (((((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))) && a24 == 1) || ((a12 + 43 <= 0 && ((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24)))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))))) && a24 == 1) || ((!(a21 == 9) && (!(6 == \old(a15)) || !(8 == \old(a21)))) && (((((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))) && a24 == 1) || ((a12 + 43 <= 0 && ((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24)))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12)))))) && a15 == 9) && 82 <= a12)) || ((((a15 <= 8 && !(a21 == 7)) && 80 < a12) && a21 == 10) && a24 == 1)) || !(\old(a21) <= 7)) || (((((((!(a15 == 5) && a15 <= 8 && !(a21 == 7)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && a21 == 9) && a12 <= 75) && 19 <= a12) && a24 == \old(a24))) || ((((a12 <= 95434 && a21 == 6) && 95380 < a12) && a24 == \old(a24)) && a15 == 9)) || ((a24 == \old(a24) && a15 == 5) && (!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10))) || !(7 <= \old(a21))) || (a12 + 43 <= 0 && ((((!(6 == \old(a15)) || !(8 == \old(a21))) && (((((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))) && a24 == 1) || ((a12 + 43 <= 0 && ((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24)))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))))) && a24 == 1) || ((!(a21 == 9) && (!(6 == \old(a15)) || !(8 == \old(a21)))) && (((((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))) && a24 == 1) || ((a12 + 43 <= 0 && ((((!(10 == \old(a21)) && ((((!(a15 == 5) || !(a24 == 1)) || 0 < a12 + 43) || !(a21 == 7)) && (!(9 == \old(a15)) || !(7 == \old(a21))) && (a15 <= 7 && !(a15 == 7)) && ((!(6 == \old(a21)) || 0 <= \old(a12) + 42) || !(5 == \old(a15)))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(a21 == 10)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) || (((!(6 == \old(a21)) || !(5 == \old(a15))) && ((((!(9 == \old(a15)) || !(7 == \old(a21))) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && 80 < a12) && !(10 == \old(a21))) && a21 == 10) && a24 == \old(a24)))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12)))))))) || (a15 == 7 && a12 + 340660 <= 0)) || ((((a21 == 8 || a21 == 7) && a24 == 1) && a15 == 9) && 82 <= a12)) || !(1 == \old(a24))) || (a15 == 7 && !(a21 == 7))) || a15 == 6 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 251.9s OverallTime, 20 OverallIterations, 19 TraceHistogramMax, 156.6s AutomataDifference, 0.0s DeadEndRemovalTime, 25.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1250 SDtfs, 88253 SDslu, 5468 SDs, 0 SdLazy, 101723 SolverSat, 11785 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17733 GetRequests, 16685 SyntacticMatches, 20 SemanticMatches, 1028 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37342 ImplicationChecksByTransitivity, 61.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4820occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 7822 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 372 PreInvPairs, 522 NumberOfFragments, 5194 HoareAnnotationTreeSize, 372 FomulaSimplifications, 415232148 FormulaSimplificationTreeSizeReduction, 5.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 127451934 FormulaSimplificationTreeSizeReductionInter, 20.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 28.0s InterpolantComputationTime, 32960 NumberOfCodeBlocks, 32960 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 32923 ConstructedInterpolants, 48 QuantifiedInterpolants, 193534807 SizeOfPredicates, 19 NumberOfNonLiveVariables, 22923 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 37 InterpolantComputations, 5 PerfectInterpolantSequences, 112651/144818 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...