./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:44:13,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:44:13,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:44:13,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:44:13,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:44:13,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:44:13,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:44:13,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:44:13,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:44:13,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:44:13,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:44:13,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:44:13,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:44:13,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:44:13,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:44:13,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:44:13,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:44:13,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:44:13,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:44:13,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:44:13,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:44:13,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:44:13,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:44:13,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:44:13,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:44:13,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:44:13,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:44:13,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:44:13,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:44:13,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:44:13,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:44:13,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:44:13,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:44:13,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:44:13,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:44:13,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:44:13,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:44:13,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:44:13,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:44:13,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:44:13,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:44:13,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:44:13,731 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:44:13,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:44:13,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:44:13,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:44:13,734 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:44:13,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:44:13,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:44:13,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:44:13,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:44:13,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:44:13,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:44:13,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:44:13,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:44:13,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:44:13,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:44:13,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:44:13,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:44:13,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:44:13,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:44:13,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:44:13,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:44:13,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:44:13,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:44:13,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:44:13,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:44:13,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:44:13,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:44:13,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:44:13,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:44:13,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2019-11-28 15:44:14,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:44:14,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:44:14,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:44:14,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:44:14,083 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:44:14,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2019-11-28 15:44:14,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c326a052/deedccd7e7ef4f09a47d27508581e028/FLAG433b4d6bc [2019-11-28 15:44:14,684 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:44:14,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2019-11-28 15:44:14,699 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c326a052/deedccd7e7ef4f09a47d27508581e028/FLAG433b4d6bc [2019-11-28 15:44:14,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c326a052/deedccd7e7ef4f09a47d27508581e028 [2019-11-28 15:44:14,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:44:14,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:44:14,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:44:14,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:44:14,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:44:14,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:14" (1/1) ... [2019-11-28 15:44:14,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771aef6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:14, skipping insertion in model container [2019-11-28 15:44:14,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:44:14" (1/1) ... [2019-11-28 15:44:14,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:44:15,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:44:15,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:44:15,497 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:44:15,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:44:15,608 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:44:15,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15 WrapperNode [2019-11-28 15:44:15,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:44:15,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:44:15,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:44:15,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:44:15,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:44:15,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:44:15,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:44:15,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:44:15,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (1/1) ... [2019-11-28 15:44:15,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:44:15,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:44:15,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:44:15,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:44:15,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (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-11-28 15:44:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:44:15,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:44:17,070 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:44:17,071 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:44:17,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:17 BoogieIcfgContainer [2019-11-28 15:44:17,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:44:17,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:44:17,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:44:17,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:44:17,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:44:14" (1/3) ... [2019-11-28 15:44:17,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585f9da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:44:17, skipping insertion in model container [2019-11-28 15:44:17,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:44:15" (2/3) ... [2019-11-28 15:44:17,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585f9da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:44:17, skipping insertion in model container [2019-11-28 15:44:17,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:17" (3/3) ... [2019-11-28 15:44:17,081 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-11-28 15:44:17,092 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:44:17,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:44:17,112 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:44:17,141 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:44:17,142 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:44:17,142 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:44:17,142 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:44:17,143 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:44:17,143 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:44:17,143 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:44:17,143 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:44:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-28 15:44:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-28 15:44:17,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:17,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:17,183 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1439061899, now seen corresponding path program 1 times [2019-11-28 15:44:17,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:17,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498568099] [2019-11-28 15:44:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:17,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498568099] [2019-11-28 15:44:17,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:17,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:17,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898901650] [2019-11-28 15:44:17,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:17,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:17,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:17,747 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-28 15:44:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:19,248 INFO L93 Difference]: Finished difference Result 748 states and 1325 transitions. [2019-11-28 15:44:19,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:19,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-28 15:44:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:19,287 INFO L225 Difference]: With dead ends: 748 [2019-11-28 15:44:19,287 INFO L226 Difference]: Without dead ends: 454 [2019-11-28 15:44:19,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-28 15:44:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 449. [2019-11-28 15:44:19,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-28 15:44:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 613 transitions. [2019-11-28 15:44:19,405 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 613 transitions. Word has length 140 [2019-11-28 15:44:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:19,406 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 613 transitions. [2019-11-28 15:44:19,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 613 transitions. [2019-11-28 15:44:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-28 15:44:19,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:19,411 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:19,411 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2046676736, now seen corresponding path program 1 times [2019-11-28 15:44:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:19,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278273805] [2019-11-28 15:44:19,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:19,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278273805] [2019-11-28 15:44:19,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:19,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 15:44:19,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562577385] [2019-11-28 15:44:19,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 15:44:19,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:19,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 15:44:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:44:19,799 INFO L87 Difference]: Start difference. First operand 449 states and 613 transitions. Second operand 10 states. [2019-11-28 15:44:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:21,280 INFO L93 Difference]: Finished difference Result 1672 states and 2295 transitions. [2019-11-28 15:44:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 15:44:21,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2019-11-28 15:44:21,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:21,287 INFO L225 Difference]: With dead ends: 1672 [2019-11-28 15:44:21,288 INFO L226 Difference]: Without dead ends: 1151 [2019-11-28 15:44:21,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:44:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2019-11-28 15:44:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1011. [2019-11-28 15:44:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-28 15:44:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1227 transitions. [2019-11-28 15:44:21,365 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1227 transitions. Word has length 145 [2019-11-28 15:44:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:21,367 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1227 transitions. [2019-11-28 15:44:21,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 15:44:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1227 transitions. [2019-11-28 15:44:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-28 15:44:21,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:21,377 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:44:21,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:21,379 INFO L82 PathProgramCache]: Analyzing trace with hash 706730423, now seen corresponding path program 1 times [2019-11-28 15:44:21,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:21,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678877150] [2019-11-28 15:44:21,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 15:44:21,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678877150] [2019-11-28 15:44:21,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:21,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:21,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548066467] [2019-11-28 15:44:21,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:21,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:21,664 INFO L87 Difference]: Start difference. First operand 1011 states and 1227 transitions. Second operand 4 states. [2019-11-28 15:44:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:22,436 INFO L93 Difference]: Finished difference Result 2867 states and 3568 transitions. [2019-11-28 15:44:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:22,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-11-28 15:44:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:22,446 INFO L225 Difference]: With dead ends: 2867 [2019-11-28 15:44:22,447 INFO L226 Difference]: Without dead ends: 1858 [2019-11-28 15:44:22,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2019-11-28 15:44:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1431. [2019-11-28 15:44:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-11-28 15:44:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1691 transitions. [2019-11-28 15:44:22,482 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1691 transitions. Word has length 167 [2019-11-28 15:44:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:22,483 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 1691 transitions. [2019-11-28 15:44:22,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1691 transitions. [2019-11-28 15:44:22,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-28 15:44:22,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:22,489 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 15:44:22,489 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash 514204718, now seen corresponding path program 1 times [2019-11-28 15:44:22,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:22,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665882527] [2019-11-28 15:44:22,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:22,643 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 15:44:22,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665882527] [2019-11-28 15:44:22,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:22,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:22,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126861335] [2019-11-28 15:44:22,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:22,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:22,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:22,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:22,648 INFO L87 Difference]: Start difference. First operand 1431 states and 1691 transitions. Second operand 3 states. [2019-11-28 15:44:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:23,206 INFO L93 Difference]: Finished difference Result 3559 states and 4205 transitions. [2019-11-28 15:44:23,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:23,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-28 15:44:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:23,219 INFO L225 Difference]: With dead ends: 3559 [2019-11-28 15:44:23,219 INFO L226 Difference]: Without dead ends: 1566 [2019-11-28 15:44:23,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2019-11-28 15:44:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1286. [2019-11-28 15:44:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-11-28 15:44:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1411 transitions. [2019-11-28 15:44:23,264 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1411 transitions. Word has length 233 [2019-11-28 15:44:23,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:23,264 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 1411 transitions. [2019-11-28 15:44:23,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1411 transitions. [2019-11-28 15:44:23,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-28 15:44:23,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:23,275 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:44:23,275 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash 209319723, now seen corresponding path program 1 times [2019-11-28 15:44:23,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:23,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513352229] [2019-11-28 15:44:23,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 15:44:23,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513352229] [2019-11-28 15:44:23,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583233766] [2019-11-28 15:44:23,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:23,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 15:44:23,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:44:23,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 15:44:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 15:44:23,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:44:23,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2019-11-28 15:44:23,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011908858] [2019-11-28 15:44:23,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:44:23,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:44:23,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:44:23,822 INFO L87 Difference]: Start difference. First operand 1286 states and 1411 transitions. Second operand 5 states. [2019-11-28 15:44:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:24,821 INFO L93 Difference]: Finished difference Result 2877 states and 3163 transitions. [2019-11-28 15:44:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:44:24,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 247 [2019-11-28 15:44:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:24,828 INFO L225 Difference]: With dead ends: 2877 [2019-11-28 15:44:24,828 INFO L226 Difference]: Without dead ends: 1453 [2019-11-28 15:44:24,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:44:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-11-28 15:44:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1286. [2019-11-28 15:44:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-11-28 15:44:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1400 transitions. [2019-11-28 15:44:24,868 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1400 transitions. Word has length 247 [2019-11-28 15:44:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:24,868 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 1400 transitions. [2019-11-28 15:44:24,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:44:24,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1400 transitions. [2019-11-28 15:44:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-28 15:44:24,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:24,874 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:44:25,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:44:25,088 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash 287206733, now seen corresponding path program 1 times [2019-11-28 15:44:25,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:25,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451222880] [2019-11-28 15:44:25,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-28 15:44:25,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451222880] [2019-11-28 15:44:25,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:25,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:25,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444039666] [2019-11-28 15:44:25,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:25,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:25,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:25,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:25,312 INFO L87 Difference]: Start difference. First operand 1286 states and 1400 transitions. Second operand 4 states. [2019-11-28 15:44:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:26,270 INFO L93 Difference]: Finished difference Result 3414 states and 3743 transitions. [2019-11-28 15:44:26,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:26,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-11-28 15:44:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:26,284 INFO L225 Difference]: With dead ends: 3414 [2019-11-28 15:44:26,284 INFO L226 Difference]: Without dead ends: 2130 [2019-11-28 15:44:26,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-28 15:44:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1986. [2019-11-28 15:44:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-11-28 15:44:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2155 transitions. [2019-11-28 15:44:26,346 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2155 transitions. Word has length 268 [2019-11-28 15:44:26,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:26,346 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2155 transitions. [2019-11-28 15:44:26,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2155 transitions. [2019-11-28 15:44:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-28 15:44:26,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:26,353 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:44:26,354 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:26,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1285312662, now seen corresponding path program 1 times [2019-11-28 15:44:26,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:26,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913202577] [2019-11-28 15:44:26,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:44:26,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913202577] [2019-11-28 15:44:26,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:26,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:44:26,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990900171] [2019-11-28 15:44:26,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:44:26,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:44:26,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:44:26,621 INFO L87 Difference]: Start difference. First operand 1986 states and 2155 transitions. Second operand 5 states. [2019-11-28 15:44:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:27,615 INFO L93 Difference]: Finished difference Result 3971 states and 4293 transitions. [2019-11-28 15:44:27,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:44:27,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2019-11-28 15:44:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:27,624 INFO L225 Difference]: With dead ends: 3971 [2019-11-28 15:44:27,624 INFO L226 Difference]: Without dead ends: 1704 [2019-11-28 15:44:27,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:44:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-11-28 15:44:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1561. [2019-11-28 15:44:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-11-28 15:44:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1632 transitions. [2019-11-28 15:44:27,666 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1632 transitions. Word has length 291 [2019-11-28 15:44:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:27,666 INFO L462 AbstractCegarLoop]: Abstraction has 1561 states and 1632 transitions. [2019-11-28 15:44:27,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:44:27,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1632 transitions. [2019-11-28 15:44:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-11-28 15:44:27,675 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:27,675 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:44:27,675 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash 733079694, now seen corresponding path program 1 times [2019-11-28 15:44:27,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:27,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441619325] [2019-11-28 15:44:27,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 15:44:27,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441619325] [2019-11-28 15:44:27,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:27,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:27,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973751603] [2019-11-28 15:44:27,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:27,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:27,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:27,839 INFO L87 Difference]: Start difference. First operand 1561 states and 1632 transitions. Second operand 3 states. [2019-11-28 15:44:28,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:28,314 INFO L93 Difference]: Finished difference Result 3120 states and 3262 transitions. [2019-11-28 15:44:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:28,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-11-28 15:44:28,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:28,321 INFO L225 Difference]: With dead ends: 3120 [2019-11-28 15:44:28,321 INFO L226 Difference]: Without dead ends: 1561 [2019-11-28 15:44:28,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2019-11-28 15:44:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2019-11-28 15:44:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2019-11-28 15:44:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1618 transitions. [2019-11-28 15:44:28,352 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1618 transitions. Word has length 318 [2019-11-28 15:44:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:28,352 INFO L462 AbstractCegarLoop]: Abstraction has 1561 states and 1618 transitions. [2019-11-28 15:44:28,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1618 transitions. [2019-11-28 15:44:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-28 15:44:28,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:28,359 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:44:28,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1479463842, now seen corresponding path program 1 times [2019-11-28 15:44:28,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:28,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553512430] [2019-11-28 15:44:28,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-28 15:44:28,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553512430] [2019-11-28 15:44:28,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:28,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:44:28,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561560261] [2019-11-28 15:44:28,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:44:28,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:44:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:28,498 INFO L87 Difference]: Start difference. First operand 1561 states and 1618 transitions. Second operand 3 states. [2019-11-28 15:44:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:29,002 INFO L93 Difference]: Finished difference Result 3119 states and 3233 transitions. [2019-11-28 15:44:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:44:29,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-11-28 15:44:29,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:29,010 INFO L225 Difference]: With dead ends: 3119 [2019-11-28 15:44:29,010 INFO L226 Difference]: Without dead ends: 994 [2019-11-28 15:44:29,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:44:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-28 15:44:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2019-11-28 15:44:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-28 15:44:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1022 transitions. [2019-11-28 15:44:29,039 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1022 transitions. Word has length 324 [2019-11-28 15:44:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:29,040 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1022 transitions. [2019-11-28 15:44:29,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:44:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1022 transitions. [2019-11-28 15:44:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-11-28 15:44:29,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:29,050 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:44:29,050 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash 495955641, now seen corresponding path program 1 times [2019-11-28 15:44:29,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:29,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544618514] [2019-11-28 15:44:29,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-28 15:44:29,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544618514] [2019-11-28 15:44:29,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:29,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:44:29,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970011566] [2019-11-28 15:44:29,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:44:29,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:44:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:44:29,395 INFO L87 Difference]: Start difference. First operand 994 states and 1022 transitions. Second operand 5 states. [2019-11-28 15:44:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:30,165 INFO L93 Difference]: Finished difference Result 2267 states and 2334 transitions. [2019-11-28 15:44:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:30,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 343 [2019-11-28 15:44:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:30,174 INFO L225 Difference]: With dead ends: 2267 [2019-11-28 15:44:30,175 INFO L226 Difference]: Without dead ends: 1275 [2019-11-28 15:44:30,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:44:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-28 15:44:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1134. [2019-11-28 15:44:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-11-28 15:44:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1164 transitions. [2019-11-28 15:44:30,210 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1164 transitions. Word has length 343 [2019-11-28 15:44:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:30,211 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 1164 transitions. [2019-11-28 15:44:30,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:44:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1164 transitions. [2019-11-28 15:44:30,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-11-28 15:44:30,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:44:30,227 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 15:44:30,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:44:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:44:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1889946957, now seen corresponding path program 1 times [2019-11-28 15:44:30,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:44:30,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464351368] [2019-11-28 15:44:30,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:44:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:44:30,614 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-28 15:44:30,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464351368] [2019-11-28 15:44:30,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:44:30,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:44:30,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985209831] [2019-11-28 15:44:30,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:44:30,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:44:30,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:44:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:30,619 INFO L87 Difference]: Start difference. First operand 1134 states and 1164 transitions. Second operand 4 states. [2019-11-28 15:44:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:44:31,169 INFO L93 Difference]: Finished difference Result 1836 states and 1878 transitions. [2019-11-28 15:44:31,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:44:31,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 367 [2019-11-28 15:44:31,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:44:31,171 INFO L225 Difference]: With dead ends: 1836 [2019-11-28 15:44:31,171 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:44:31,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:44:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:44:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:44:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:44:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:44:31,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2019-11-28 15:44:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:44:31,177 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:44:31,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:44:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:44:31,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:44:31,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:44:31,764 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-11-28 15:44:32,313 WARN L192 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2019-11-28 15:44:32,319 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,321 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,322 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,323 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-28 15:44:32,324 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-28 15:44:32,324 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-28 15:44:32,324 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-28 15:44:32,325 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-28 15:44:32,325 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-28 15:44:32,325 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-28 15:44:32,325 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,326 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,326 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,326 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-28 15:44:32,326 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-28 15:44:32,327 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-28 15:44:32,327 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-28 15:44:32,327 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-28 15:44:32,327 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-28 15:44:32,328 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-28 15:44:32,328 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,328 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,329 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,329 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-28 15:44:32,329 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-28 15:44:32,329 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-28 15:44:32,330 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-28 15:44:32,330 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-28 15:44:32,330 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,330 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,331 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,331 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-28 15:44:32,331 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-28 15:44:32,331 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-28 15:44:32,332 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-28 15:44:32,332 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-28 15:44:32,332 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-28 15:44:32,332 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-28 15:44:32,333 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-28 15:44:32,333 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,333 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,334 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,334 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-28 15:44:32,334 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-28 15:44:32,334 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-28 15:44:32,335 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-28 15:44:32,335 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-28 15:44:32,335 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-28 15:44:32,336 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-28 15:44:32,336 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-28 15:44:32,336 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,336 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,337 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,337 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-28 15:44:32,337 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-28 15:44:32,337 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-28 15:44:32,338 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-28 15:44:32,338 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-28 15:44:32,338 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-28 15:44:32,338 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-28 15:44:32,339 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-28 15:44:32,339 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-28 15:44:32,339 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,339 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,340 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,340 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-28 15:44:32,340 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-28 15:44:32,341 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-28 15:44:32,341 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-28 15:44:32,341 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-28 15:44:32,341 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-28 15:44:32,342 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,342 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,342 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,342 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-28 15:44:32,343 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-28 15:44:32,343 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-28 15:44:32,343 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-28 15:44:32,343 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-28 15:44:32,344 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:44:32,344 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-28 15:44:32,344 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-28 15:44:32,345 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-28 15:44:32,345 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,345 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,345 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,346 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-28 15:44:32,346 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-28 15:44:32,346 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-28 15:44:32,346 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-28 15:44:32,347 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-28 15:44:32,347 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,347 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,347 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,348 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-28 15:44:32,348 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-28 15:44:32,348 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-28 15:44:32,348 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-28 15:44:32,349 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-28 15:44:32,349 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-28 15:44:32,349 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-28 15:44:32,350 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-28 15:44:32,350 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-28 15:44:32,350 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-28 15:44:32,350 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:44:32,351 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2019-11-28 15:44:32,351 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-28 15:44:32,351 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,351 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,352 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-28 15:44:32,352 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-28 15:44:32,352 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-28 15:44:32,353 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-28 15:44:32,353 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-28 15:44:32,353 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-28 15:44:32,353 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-28 15:44:32,354 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-28 15:44:32,355 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-28 15:44:32,357 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse8 (= ~a19~0 1))) (let ((.cse4 (not (= ~a17~0 9))) (.cse0 (not .cse8)) (.cse5 (= ~a17~0 8)) (.cse6 (= ~a21~0 1)) (.cse3 (= ~a28~0 7)) (.cse7 (= ~a11~0 1)) (.cse2 (= ~a25~0 1)) (.cse1 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse5 .cse8 .cse6 .cse2) (and (= ~a28~0 9) .cse5 .cse8 .cse6) (and .cse0 (= ~a28~0 8) (<= ~a25~0 0) .cse4) (and .cse5 .cse3 .cse6) (and .cse1 .cse5 .cse8 .cse6 (or (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and .cse0 .cse7) (and .cse1 .cse5 .cse8 .cse6 (= 1 ULTIMATE.start_calculate_output_~input)) (and (<= ~a17~0 7) .cse3 .cse2) (and .cse8 (not .cse7) .cse2 (not .cse1))))) [2019-11-28 15:44:32,358 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,358 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,358 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-28 15:44:32,359 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-28 15:44:32,359 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-28 15:44:32,359 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-28 15:44:32,359 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-28 15:44:32,360 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-28 15:44:32,360 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-28 15:44:32,360 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,361 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,361 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-28 15:44:32,361 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-28 15:44:32,361 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-28 15:44:32,362 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-28 15:44:32,362 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-28 15:44:32,362 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-28 15:44:32,362 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-28 15:44:32,363 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-28 15:44:32,363 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-28 15:44:32,363 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,363 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,364 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-28 15:44:32,364 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-28 15:44:32,364 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-28 15:44:32,365 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-28 15:44:32,365 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-28 15:44:32,365 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-28 15:44:32,366 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse8 (= ~a19~0 1))) (let ((.cse4 (not (= ~a17~0 9))) (.cse0 (not .cse8)) (.cse5 (= ~a17~0 8)) (.cse6 (= ~a21~0 1)) (.cse3 (= ~a28~0 7)) (.cse7 (= ~a11~0 1)) (.cse2 (= ~a25~0 1)) (.cse1 (= ~a28~0 10))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse6 .cse7) (and .cse5 .cse8 .cse6 .cse2) (and (= ~a28~0 9) .cse5 .cse8 .cse6) (and .cse0 (= ~a28~0 8) (<= ~a25~0 0) .cse4) (and .cse5 .cse3 .cse6) (and .cse1 .cse5 .cse8 .cse6 (or (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (and .cse0 .cse7) (and .cse1 .cse5 .cse8 .cse6 (= 1 ULTIMATE.start_calculate_output_~input)) (and (<= ~a17~0 7) .cse3 .cse2) (and .cse8 (not .cse7) .cse2 (not .cse1))))) [2019-11-28 15:44:32,366 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,366 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,366 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-28 15:44:32,367 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-28 15:44:32,367 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-28 15:44:32,367 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-28 15:44:32,368 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-28 15:44:32,368 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,368 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,368 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-28 15:44:32,369 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-28 15:44:32,369 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-28 15:44:32,369 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-28 15:44:32,369 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-28 15:44:32,370 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-28 15:44:32,370 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-28 15:44:32,370 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-28 15:44:32,370 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-28 15:44:32,371 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,371 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,371 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-28 15:44:32,371 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,372 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-28 15:44:32,372 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-28 15:44:32,372 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-28 15:44:32,373 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-28 15:44:32,373 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-28 15:44:32,373 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:44:32,373 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-28 15:44:32,374 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,374 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,374 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,374 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-28 15:44:32,375 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-28 15:44:32,375 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-28 15:44:32,375 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-28 15:44:32,375 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-28 15:44:32,376 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,376 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,376 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,376 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-28 15:44:32,377 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-28 15:44:32,377 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-28 15:44:32,377 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-28 15:44:32,378 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-28 15:44:32,378 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-28 15:44:32,378 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,378 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,379 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,379 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-28 15:44:32,379 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-28 15:44:32,379 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-28 15:44:32,380 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-28 15:44:32,380 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-28 15:44:32,380 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-28 15:44:32,380 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:44:32,381 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-28 15:44:32,381 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-28 15:44:32,381 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,381 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,381 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,382 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-28 15:44:32,382 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-28 15:44:32,382 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-28 15:44:32,382 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-28 15:44:32,383 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-28 15:44:32,383 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,383 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,383 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-28 15:44:32,384 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-28 15:44:32,384 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-28 15:44:32,384 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-28 15:44:32,384 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-28 15:44:32,385 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-28 15:44:32,385 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-28 15:44:32,385 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-28 15:44:32,385 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-28 15:44:32,385 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-28 15:44:32,386 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-28 15:44:32,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:44:32 BoogieIcfgContainer [2019-11-28 15:44:32,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:44:32,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:44:32,453 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:44:32,453 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:44:32,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:44:17" (3/4) ... [2019-11-28 15:44:32,461 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:44:32,513 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:44:32,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:44:32,781 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:44:32,781 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:44:32,783 INFO L168 Benchmark]: Toolchain (without parser) took 17835.57 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 618.1 MB). Free memory was 948.3 MB in the beginning and 1.2 GB in the end (delta: -224.0 MB). Peak memory consumption was 394.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,783 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:44:32,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 660.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,786 INFO L168 Benchmark]: Boogie Preprocessor took 89.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,786 INFO L168 Benchmark]: RCFGBuilder took 1285.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,787 INFO L168 Benchmark]: TraceAbstraction took 15378.15 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 467.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -198.6 MB). Peak memory consumption was 269.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,788 INFO L168 Benchmark]: Witness Printer took 329.11 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:44:32,791 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.66 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 660.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1285.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15378.15 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 467.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -198.6 MB). Peak memory consumption was 269.1 MB. Max. memory is 11.5 GB. * Witness Printer took 329.11 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((!(a19 == 1) && a28 == 10) && a25 == 1) || ((!(a19 == 1) && a28 == 7) && !(a17 == 9))) || ((a17 == 8 && a21 == 1) && a11 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1)) || (((!(a19 == 1) && a28 == 8) && a25 <= 0) && !(a17 == 9))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && (((4 == input || 3 == input) || 6 == input) || 5 == input))) || (!(a19 == 1) && a11 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && 1 == input)) || ((a17 <= 7 && a28 == 7) && a25 == 1)) || (((a19 == 1 && !(a11 == 1)) && a25 == 1) && !(a28 == 10)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((!(a19 == 1) && a28 == 10) && a25 == 1) || ((!(a19 == 1) && a28 == 7) && !(a17 == 9))) || ((a17 == 8 && a21 == 1) && a11 == 1)) || (((a17 == 8 && a19 == 1) && a21 == 1) && a25 == 1)) || (((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1)) || (((!(a19 == 1) && a28 == 8) && a25 <= 0) && !(a17 == 9))) || ((a17 == 8 && a28 == 7) && a21 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && (((4 == input || 3 == input) || 6 == input) || 5 == input))) || (!(a19 == 1) && a11 == 1)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a21 == 1) && 1 == input)) || ((a17 <= 7 && a28 == 7) && a25 == 1)) || (((a19 == 1 && !(a11 == 1)) && a25 == 1) && !(a28 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 14.0s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 1066 SDtfs, 3018 SDslu, 331 SDs, 0 SdLazy, 7113 SolverSat, 968 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1986occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1447 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 321 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1294 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 810 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3090 NumberOfCodeBlocks, 3090 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3078 ConstructedInterpolants, 0 QuantifiedInterpolants, 1873482 SizeOfPredicates, 6 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2622/2625 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...