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/Problem01_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:42:09,731 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:42:09,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:42:09,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:42:09,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:42:09,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:42:09,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:42:09,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:42:09,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:42:09,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:42:09,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:42:09,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:42:09,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:42:09,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:42:09,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:42:09,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:42:09,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:42:09,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:42:09,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:42:09,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:42:09,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:42:09,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:42:09,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:42:09,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:42:09,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:42:09,773 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:42:09,773 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:42:09,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:42:09,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:42:09,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:42:09,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:42:09,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:42:09,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:42:09,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:42:09,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:42:09,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:42:09,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:42:09,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:42:09,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:42:09,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:42:09,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:42:09,796 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 00:42:09,812 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:42:09,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:42:09,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:42:09,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:42:09,814 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:42:09,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:42:09,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:42:09,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:42:09,815 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:42:09,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:42:09,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:42:09,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:42:09,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:42:09,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:42:09,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:42:09,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:42:09,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:42:09,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:42:09,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:42:09,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:42:09,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:42:09,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:42:09,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:42:09,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:42:09,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:42:09,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:42:09,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:42:09,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:42:09,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:42:09,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:42:09,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:42:09,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:42:09,867 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:42:09,867 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:42:09,868 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label08.c [2019-10-02 00:42:09,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d650160/d7d4d52255e945d5872c962e544d5fc0/FLAG594e51019 [2019-10-02 00:42:10,450 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:42:10,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label08.c [2019-10-02 00:42:10,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d650160/d7d4d52255e945d5872c962e544d5fc0/FLAG594e51019 [2019-10-02 00:42:10,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d650160/d7d4d52255e945d5872c962e544d5fc0 [2019-10-02 00:42:10,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:42:10,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:42:10,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:42:10,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:42:10,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:42:10,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:42:10" (1/1) ... [2019-10-02 00:42:10,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35da1448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:10, skipping insertion in model container [2019-10-02 00:42:10,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:42:10" (1/1) ... [2019-10-02 00:42:10,771 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:42:10,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:42:11,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:42:11,372 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:42:11,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:42:11,532 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:42:11,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11 WrapperNode [2019-10-02 00:42:11,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:42:11,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:42:11,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:42:11,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:42:11,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (1/1) ... [2019-10-02 00:42:11,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:42:11,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:42:11,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:42:11,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:42:11,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (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 00:42:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:42:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:42:11,746 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:42:11,746 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:42:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:42:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:42:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:42:11,746 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:42:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:42:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:42:11,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:42:12,978 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:42:12,979 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:42:12,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:12 BoogieIcfgContainer [2019-10-02 00:42:12,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:42:12,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:42:12,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:42:12,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:42:12,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:42:10" (1/3) ... [2019-10-02 00:42:12,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57718880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:12, skipping insertion in model container [2019-10-02 00:42:12,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:42:11" (2/3) ... [2019-10-02 00:42:12,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57718880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:42:12, skipping insertion in model container [2019-10-02 00:42:12,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:42:12" (3/3) ... [2019-10-02 00:42:12,995 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label08.c [2019-10-02 00:42:13,007 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:42:13,018 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:42:13,039 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:42:13,087 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:42:13,088 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:42:13,088 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:42:13,088 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:42:13,089 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:42:13,089 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:42:13,089 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:42:13,089 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:42:13,089 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:42:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2019-10-02 00:42:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 00:42:13,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:13,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:42:13,148 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1920403729, now seen corresponding path program 1 times [2019-10-02 00:42:13,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:13,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:13,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:13,674 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 00:42:13,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:13,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:42:13,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:42:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:42:13,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:13,699 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2019-10-02 00:42:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:14,526 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2019-10-02 00:42:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:42:14,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-02 00:42:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:14,555 INFO L225 Difference]: With dead ends: 547 [2019-10-02 00:42:14,555 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 00:42:14,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 00:42:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 00:42:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 00:42:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 394 transitions. [2019-10-02 00:42:14,683 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 394 transitions. Word has length 119 [2019-10-02 00:42:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:14,684 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 394 transitions. [2019-10-02 00:42:14,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:42:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 394 transitions. [2019-10-02 00:42:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 00:42:14,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:14,688 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:14,689 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 10659704, now seen corresponding path program 1 times [2019-10-02 00:42:14,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:14,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:14,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:42:14,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:42:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:42:14,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:42:14,824 INFO L87 Difference]: Start difference. First operand 278 states and 394 transitions. Second operand 6 states. [2019-10-02 00:42:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:15,592 INFO L93 Difference]: Finished difference Result 840 states and 1222 transitions. [2019-10-02 00:42:15,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:42:15,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 00:42:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:15,599 INFO L225 Difference]: With dead ends: 840 [2019-10-02 00:42:15,600 INFO L226 Difference]: Without dead ends: 568 [2019-10-02 00:42:15,601 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:42:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-02 00:42:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 556. [2019-10-02 00:42:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-02 00:42:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 785 transitions. [2019-10-02 00:42:15,639 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 785 transitions. Word has length 129 [2019-10-02 00:42:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:15,639 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 785 transitions. [2019-10-02 00:42:15,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:42:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 785 transitions. [2019-10-02 00:42:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 00:42:15,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:15,643 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:15,644 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:15,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:15,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1525536778, now seen corresponding path program 1 times [2019-10-02 00:42:15,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:15,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:15,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:15,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:15,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:15,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:42:15,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:42:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:42:15,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:42:15,989 INFO L87 Difference]: Start difference. First operand 556 states and 785 transitions. Second operand 5 states. [2019-10-02 00:42:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:16,720 INFO L93 Difference]: Finished difference Result 1205 states and 1730 transitions. [2019-10-02 00:42:16,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:42:16,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-02 00:42:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:16,729 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 00:42:16,729 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:42:16,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:42:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:42:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-10-02 00:42:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 00:42:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 712 transitions. [2019-10-02 00:42:16,758 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 712 transitions. Word has length 130 [2019-10-02 00:42:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:16,758 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 712 transitions. [2019-10-02 00:42:16,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:42:16,759 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 712 transitions. [2019-10-02 00:42:16,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 00:42:16,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:16,762 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:16,762 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:16,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:16,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1052025540, now seen corresponding path program 1 times [2019-10-02 00:42:16,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:16,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:16,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:17,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:17,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:42:17,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:42:17,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:42:17,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:42:17,047 INFO L87 Difference]: Start difference. First operand 554 states and 712 transitions. Second operand 5 states. [2019-10-02 00:42:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:17,631 INFO L93 Difference]: Finished difference Result 1184 states and 1552 transitions. [2019-10-02 00:42:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:42:17,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-02 00:42:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:17,635 INFO L225 Difference]: With dead ends: 1184 [2019-10-02 00:42:17,636 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 00:42:17,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:42:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 00:42:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-10-02 00:42:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 00:42:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 708 transitions. [2019-10-02 00:42:17,658 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 708 transitions. Word has length 131 [2019-10-02 00:42:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:17,658 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 708 transitions. [2019-10-02 00:42:17,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:42:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 708 transitions. [2019-10-02 00:42:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 00:42:17,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:17,662 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:17,662 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash -866015874, now seen corresponding path program 1 times [2019-10-02 00:42:17,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:17,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:17,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:17,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:17,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:42:17,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:42:17,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:42:17,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:42:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:17,758 INFO L87 Difference]: Start difference. First operand 554 states and 708 transitions. Second operand 3 states. [2019-10-02 00:42:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:18,231 INFO L93 Difference]: Finished difference Result 1509 states and 1954 transitions. [2019-10-02 00:42:18,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:42:18,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-10-02 00:42:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:18,237 INFO L225 Difference]: With dead ends: 1509 [2019-10-02 00:42:18,237 INFO L226 Difference]: Without dead ends: 961 [2019-10-02 00:42:18,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:42:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-10-02 00:42:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2019-10-02 00:42:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-10-02 00:42:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1180 transitions. [2019-10-02 00:42:18,269 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1180 transitions. Word has length 134 [2019-10-02 00:42:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:18,270 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1180 transitions. [2019-10-02 00:42:18,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:42:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1180 transitions. [2019-10-02 00:42:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 00:42:18,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:18,275 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:42:18,276 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash -494413009, now seen corresponding path program 1 times [2019-10-02 00:42:18,276 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:18,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:18,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:18,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:18,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:18,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:18,442 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) [2019-10-02 00:42:18,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:42:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:18,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:42:18,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:42:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 00:42:18,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:42:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:42:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:42:18,720 INFO L87 Difference]: Start difference. First operand 959 states and 1180 transitions. Second operand 8 states. [2019-10-02 00:42:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:20,466 INFO L93 Difference]: Finished difference Result 2965 states and 3999 transitions. [2019-10-02 00:42:20,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 00:42:20,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 165 [2019-10-02 00:42:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:20,481 INFO L225 Difference]: With dead ends: 2965 [2019-10-02 00:42:20,482 INFO L226 Difference]: Without dead ends: 2012 [2019-10-02 00:42:20,485 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:42:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2019-10-02 00:42:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1275. [2019-10-02 00:42:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-10-02 00:42:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1568 transitions. [2019-10-02 00:42:20,560 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1568 transitions. Word has length 165 [2019-10-02 00:42:20,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:20,561 INFO L475 AbstractCegarLoop]: Abstraction has 1275 states and 1568 transitions. [2019-10-02 00:42:20,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:42:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1568 transitions. [2019-10-02 00:42:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 00:42:20,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:20,567 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:20,567 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:20,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1777312675, now seen corresponding path program 1 times [2019-10-02 00:42:20,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:20,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:20,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:20,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 66 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:42:20,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:20,735 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 00:42:20,763 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 00:42:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:20,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 00:42:20,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:20,960 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 00:42:20,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:20,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 00:42:20,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:42:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:42:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:42:20,966 INFO L87 Difference]: Start difference. First operand 1275 states and 1568 transitions. Second operand 8 states. [2019-10-02 00:42:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:22,377 INFO L93 Difference]: Finished difference Result 4276 states and 5530 transitions. [2019-10-02 00:42:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 00:42:22,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-02 00:42:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:22,395 INFO L225 Difference]: With dead ends: 4276 [2019-10-02 00:42:22,395 INFO L226 Difference]: Without dead ends: 3007 [2019-10-02 00:42:22,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-10-02 00:42:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2019-10-02 00:42:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2558. [2019-10-02 00:42:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2019-10-02 00:42:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3124 transitions. [2019-10-02 00:42:22,483 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3124 transitions. Word has length 185 [2019-10-02 00:42:22,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:22,484 INFO L475 AbstractCegarLoop]: Abstraction has 2558 states and 3124 transitions. [2019-10-02 00:42:22,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:42:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3124 transitions. [2019-10-02 00:42:22,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 00:42:22,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:42:22,494 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:42:22,494 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:42:22,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:42:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash -168440494, now seen corresponding path program 1 times [2019-10-02 00:42:22,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:42:22,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:42:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:22,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:42:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:42:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 139 proven. 69 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 00:42:22,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:42:22,714 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) [2019-10-02 00:42:22,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:42:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:42:22,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 00:42:22,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:42:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 174 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 00:42:22,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:42:22,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2019-10-02 00:42:22,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 00:42:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 00:42:22,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 00:42:22,951 INFO L87 Difference]: Start difference. First operand 2558 states and 3124 transitions. Second operand 11 states. [2019-10-02 00:42:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:42:24,554 INFO L93 Difference]: Finished difference Result 4159 states and 5077 transitions. [2019-10-02 00:42:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:42:24,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 239 [2019-10-02 00:42:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:42:24,556 INFO L225 Difference]: With dead ends: 4159 [2019-10-02 00:42:24,556 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:42:24,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-10-02 00:42:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:42:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:42:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:42:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:42:24,566 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 239 [2019-10-02 00:42:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:42:24,566 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:42:24,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 00:42:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:42:24,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:42:24,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:42:25,335 WARN L191 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-10-02 00:42:25,616 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-10-02 00:42:25,884 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-10-02 00:42:25,887 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:42:25,888 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a20~0 |old(~a20~0)|)) [2019-10-02 00:42:25,888 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:42:25,888 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-02 00:42:25,888 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-02 00:42:25,888 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,888 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,888 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-02 00:42:25,889 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,890 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-02 00:42:25,891 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-02 00:42:25,892 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,893 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-02 00:42:25,894 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-02 00:42:25,895 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-02 00:42:25,896 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,897 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-02 00:42:25,898 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-02 00:42:25,899 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-02 00:42:25,900 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,901 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-02 00:42:25,902 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-02 00:42:25,903 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-02 00:42:25,904 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-02 00:42:25,904 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-02 00:42:25,904 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-02 00:42:25,904 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-02 00:42:25,904 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-02 00:42:25,904 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-02 00:42:25,905 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a7~0 |old(~a7~0)|)) (.cse10 (= 13 |old(~a8~0)|)) (.cse17 (= 1 |old(~a7~0)|)) (.cse14 (= 1 ~a7~0)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse7 (= ~a16~0 |old(~a16~0)|)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse9 (not (= ~a8~0 13)))) (let ((.cse13 (and .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)) (.cse16 (not (= 1 |old(~a21~0)|))) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse18 (not (= 4 |old(~a16~0)|))) (.cse12 (not .cse17)) (.cse19 (= 13 ~a8~0)) (.cse20 (= ~a17~0 1)) (.cse21 (= ~a21~0 1)) (.cse22 (= ~a20~0 1)) (.cse23 (not .cse10)) (.cse24 (not (= 1 |old(~a17~0)|))) (.cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse11 (= 6 |old(~a16~0)|)) (.cse2 (not (= 8 ~a12~0))) (.cse0 (not (<= |old(~a7~0)| 0)))) (and (or (or .cse0 (or .cse1 .cse2)) .cse3) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse2 .cse0) (or .cse11 .cse10 .cse2 .cse12 .cse13) (or (or .cse1 .cse10 .cse2) .cse12 .cse13) (or .cse12 (and .cse14 (and .cse5 .cse6 .cse7) .cse8) (let ((.cse15 (not (<= |old(~a21~0)| 0)))) (and (or .cse11 .cse2 .cse15) (or .cse1 .cse2 .cse15)))) (or .cse16 .cse17 .cse1 .cse18 .cse2 (and (not (= ~a7~0 1)) .cse19 .cse7 .cse20 .cse21 .cse22) .cse23 .cse24) (or .cse16 .cse1 .cse18 .cse2 .cse12 (and .cse14 .cse19 .cse7 .cse20 .cse21 .cse22) .cse23 .cse24) (or .cse3 (or .cse11 .cse2 .cse0))))) [2019-10-02 00:42:25,905 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-02 00:42:25,905 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,905 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,905 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,905 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-02 00:42:25,906 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,907 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-02 00:42:25,908 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-02 00:42:25,909 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-02 00:42:25,910 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-02 00:42:25,911 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-02 00:42:25,912 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:42:25,912 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a16~0 6)) (= ~a17~0 1) (= ~a12~0 8) (= ~a20~0 1) (<= ~a7~0 0) (not (= ~a8~0 13))) [2019-10-02 00:42:25,912 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:42:25,912 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:42:25,912 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (= 6 |old(~a16~0)|) (not (= 1 |old(~a20~0)|)) (and (not (= ~a8~0 13)) (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (<= ~a21~0 |old(~a21~0)|) (= ~a16~0 |old(~a16~0)|) (= ~a20~0 |old(~a20~0)|)) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (not (<= |old(~a7~0)| 0)) (not (= 1 |old(~a17~0)|))) [2019-10-02 00:42:25,912 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:42:25,913 INFO L439 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (<= ~a7~0 0)) (.cse3 (not (= ~a8~0 13))) (.cse2 (= 1 ~a7~0)) (.cse0 (= ~a20~0 1)) (.cse4 (not (= ~a16~0 6)))) (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (not (= 1 |old(~a17~0)|)) (and (= 13 ~a8~0) (= ~a16~0 4) (= ~a17~0 1) (= ~a21~0 1) .cse0) (not (= 1 |old(~a20~0)|)) (and .cse3 .cse1) (and .cse4 .cse1) (and .cse2 .cse4 .cse3) (not (<= |old(~a7~0)| 0)) (and .cse2 (let ((.cse5 (<= ~a21~0 0))) (or (and .cse5 .cse0) (and .cse5 .cse4)))))) [2019-10-02 00:42:25,913 INFO L443 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2019-10-02 00:42:25,913 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-02 00:42:25,913 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (<= ~a7~0 0)) (.cse3 (not (= ~a8~0 13))) (.cse2 (= 1 ~a7~0)) (.cse0 (= ~a20~0 1)) (.cse4 (not (= ~a16~0 6)))) (or (= 6 |old(~a16~0)|) (= 13 |old(~a8~0)|) (not (= 8 ~a12~0)) (and .cse0 .cse1) (and .cse2 .cse0 .cse3) (not (= 1 |old(~a17~0)|)) (and (= 13 ~a8~0) (= ~a16~0 4) (= ~a17~0 1) (= ~a21~0 1) .cse0) (not (= 1 |old(~a20~0)|)) (and .cse3 .cse1) (and .cse4 .cse1) (and .cse2 .cse4 .cse3) (not (<= |old(~a7~0)| 0)) (and .cse2 (let ((.cse5 (<= ~a21~0 0))) (or (and .cse5 .cse0) (and .cse5 .cse4)))))) [2019-10-02 00:42:25,913 INFO L443 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2019-10-02 00:42:25,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:42:25 BoogieIcfgContainer [2019-10-02 00:42:25,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:42:25,933 INFO L168 Benchmark]: Toolchain (without parser) took 15178.53 ms. Allocated memory was 132.1 MB in the beginning and 502.3 MB in the end (delta: 370.1 MB). Free memory was 86.2 MB in the beginning and 178.6 MB in the end (delta: -92.4 MB). Peak memory consumption was 277.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:25,934 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:42:25,935 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.00 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 86.0 MB in the beginning and 156.8 MB in the end (delta: -70.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:25,936 INFO L168 Benchmark]: Boogie Preprocessor took 139.88 ms. Allocated memory is still 200.3 MB. Free memory was 156.8 MB in the beginning and 151.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:25,937 INFO L168 Benchmark]: RCFGBuilder took 1308.06 ms. Allocated memory was 200.3 MB in the beginning and 223.3 MB in the end (delta: 23.1 MB). Free memory was 151.6 MB in the beginning and 166.1 MB in the end (delta: -14.5 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:25,938 INFO L168 Benchmark]: TraceAbstraction took 12947.23 ms. Allocated memory was 223.3 MB in the beginning and 502.3 MB in the end (delta: 278.9 MB). Free memory was 164.8 MB in the beginning and 178.6 MB in the end (delta: -13.8 MB). Peak memory consumption was 265.1 MB. Max. memory is 7.1 GB. [2019-10-02 00:42:25,942 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.00 ms. Allocated memory was 132.1 MB in the beginning and 200.3 MB in the end (delta: 68.2 MB). Free memory was 86.0 MB in the beginning and 156.8 MB in the end (delta: -70.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.88 ms. Allocated memory is still 200.3 MB. Free memory was 156.8 MB in the beginning and 151.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1308.06 ms. Allocated memory was 200.3 MB in the beginning and 223.3 MB in the end (delta: 23.1 MB). Free memory was 151.6 MB in the beginning and 166.1 MB in the end (delta: -14.5 MB). Peak memory consumption was 83.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12947.23 ms. Allocated memory was 223.3 MB in the beginning and 502.3 MB in the end (delta: 278.9 MB). Free memory was 164.8 MB in the beginning and 178.6 MB in the end (delta: -13.8 MB). Peak memory consumption was 265.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((6 == \old(a16) || 13 == \old(a8)) || !(8 == a12)) || (a20 == 1 && a7 <= 0)) || ((1 == a7 && a20 == 1) && !(a8 == 13))) || !(1 == \old(a17))) || ((((13 == a8 && a16 == 4) && a17 == 1) && a21 == 1) && a20 == 1)) || !(1 == \old(a20))) || (!(a8 == 13) && a7 <= 0)) || (!(a16 == 6) && a7 <= 0)) || ((1 == a7 && !(a16 == 6)) && !(a8 == 13))) || !(\old(a7) <= 0)) || (1 == a7 && ((a21 <= 0 && a20 == 1) || (a21 <= 0 && !(a16 == 6)))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 12.8s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 257 SDtfs, 4351 SDslu, 400 SDs, 0 SdLazy, 5878 SolverSat, 1030 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 712 GetRequests, 629 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2558occurred in iteration=7, 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: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1200 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 75 PreInvPairs, 115 NumberOfFragments, 600 HoareAnnotationTreeSize, 75 FomulaSimplifications, 5925 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1078 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1810 ConstructedInterpolants, 0 QuantifiedInterpolants, 1220905 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1594 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 606/762 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...