./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label30.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/Problem01_label30.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 cc1563f4697cf21aca476a1aac04fcd8ee81163f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:43:29,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:29,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:29,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:29,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:29,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:29,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:29,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:29,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:29,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:29,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:29,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:29,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:29,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:29,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:29,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:29,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:29,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:29,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:29,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:29,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:29,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:29,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:29,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:29,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:29,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:29,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:29,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:29,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:29,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:29,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:29,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:29,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:29,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:29,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:29,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:29,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:29,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:29,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:29,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:29,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:29,674 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:43:29,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:29,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:29,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:29,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:29,714 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:29,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:29,715 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:29,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:29,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:29,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:29,716 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:29,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:29,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:29,718 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:29,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:29,718 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:29,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:29,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:29,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:29,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:29,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:29,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:29,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:29,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:29,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:29,725 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:29,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:29,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:29,726 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:29,727 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 -> cc1563f4697cf21aca476a1aac04fcd8ee81163f [2019-11-28 15:43:30,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:30,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:30,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:30,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:30,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:30,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2019-11-28 15:43:30,111 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781aabf73/75eafa396f6148d09a152df1740513c2/FLAG4863a61ef [2019-11-28 15:43:30,708 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:30,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label30.c [2019-11-28 15:43:30,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781aabf73/75eafa396f6148d09a152df1740513c2/FLAG4863a61ef [2019-11-28 15:43:30,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781aabf73/75eafa396f6148d09a152df1740513c2 [2019-11-28 15:43:30,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:30,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:30,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:30,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:30,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:30,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:30" (1/1) ... [2019-11-28 15:43:30,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a4f9cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:30, skipping insertion in model container [2019-11-28 15:43:30,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:30" (1/1) ... [2019-11-28 15:43:30,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:31,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:31,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:31,416 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:31,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:31,620 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:31,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31 WrapperNode [2019-11-28 15:43:31,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:31,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:31,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:31,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:31,631 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:43:31" (1/1) ... [2019-11-28 15:43:31,656 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:43:31" (1/1) ... [2019-11-28 15:43:31,720 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:31,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:31,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:31,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:31,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (1/1) ... [2019-11-28 15:43:31,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:31,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:31,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:31,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:31,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (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:43:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:31,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:33,015 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:33,015 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:33,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:33 BoogieIcfgContainer [2019-11-28 15:43:33,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:33,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:33,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:33,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:33,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:30" (1/3) ... [2019-11-28 15:43:33,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb4aa09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:33, skipping insertion in model container [2019-11-28 15:43:33,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:31" (2/3) ... [2019-11-28 15:43:33,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb4aa09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:33, skipping insertion in model container [2019-11-28 15:43:33,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:33" (3/3) ... [2019-11-28 15:43:33,026 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label30.c [2019-11-28 15:43:33,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:33,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:33,054 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:33,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:33,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:33,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:33,083 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:33,083 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:33,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:33,084 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:33,084 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-28 15:43:33,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:33,117 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] [2019-11-28 15:43:33,118 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:33,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1318724346, now seen corresponding path program 1 times [2019-11-28 15:43:33,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:33,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186804229] [2019-11-28 15:43:33,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:33,671 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:43:33,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186804229] [2019-11-28 15:43:33,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:33,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:33,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105517650] [2019-11-28 15:43:33,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:33,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:33,706 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-28 15:43:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:34,683 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-28 15:43:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:34,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-28 15:43:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:34,703 INFO L225 Difference]: With dead ends: 528 [2019-11-28 15:43:34,703 INFO L226 Difference]: Without dead ends: 266 [2019-11-28 15:43:34,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-28 15:43:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-28 15:43:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 15:43:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-11-28 15:43:34,772 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 125 [2019-11-28 15:43:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:34,774 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-11-28 15:43:34,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-11-28 15:43:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 15:43:34,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:34,778 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:43:34,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1866428878, now seen corresponding path program 1 times [2019-11-28 15:43:34,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:34,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347362522] [2019-11-28 15:43:34,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:34,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:34,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347362522] [2019-11-28 15:43:34,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:34,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:34,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157825918] [2019-11-28 15:43:34,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:34,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:34,983 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 3 states. [2019-11-28 15:43:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:35,549 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2019-11-28 15:43:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:35,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-28 15:43:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:35,565 INFO L225 Difference]: With dead ends: 792 [2019-11-28 15:43:35,565 INFO L226 Difference]: Without dead ends: 528 [2019-11-28 15:43:35,567 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:43:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-28 15:43:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-28 15:43:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-28 15:43:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-11-28 15:43:35,620 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 129 [2019-11-28 15:43:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:35,621 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-11-28 15:43:35,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-11-28 15:43:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-28 15:43:35,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:35,630 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:43:35,631 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1624585415, now seen corresponding path program 1 times [2019-11-28 15:43:35,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:35,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68700835] [2019-11-28 15:43:35,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 15:43:35,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68700835] [2019-11-28 15:43:35,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:35,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:35,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694603908] [2019-11-28 15:43:35,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:35,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:35,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:35,726 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-11-28 15:43:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:36,295 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-11-28 15:43:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:36,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-28 15:43:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:36,301 INFO L225 Difference]: With dead ends: 1316 [2019-11-28 15:43:36,302 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:36,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-11-28 15:43:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-28 15:43:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-11-28 15:43:36,325 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 148 [2019-11-28 15:43:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:36,325 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-11-28 15:43:36,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-11-28 15:43:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-28 15:43:36,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:36,329 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:36,329 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash 130660739, now seen corresponding path program 1 times [2019-11-28 15:43:36,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:36,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119314014] [2019-11-28 15:43:36,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:43:36,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119314014] [2019-11-28 15:43:36,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:36,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:36,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823370467] [2019-11-28 15:43:36,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:36,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:36,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:36,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:36,465 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-11-28 15:43:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:37,265 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-11-28 15:43:37,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:37,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-28 15:43:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:37,271 INFO L225 Difference]: With dead ends: 1449 [2019-11-28 15:43:37,271 INFO L226 Difference]: Without dead ends: 792 [2019-11-28 15:43:37,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-28 15:43:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-11-28 15:43:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-11-28 15:43:37,299 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 152 [2019-11-28 15:43:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:37,300 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-11-28 15:43:37,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-11-28 15:43:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 15:43:37,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:37,306 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:43:37,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1709270971, now seen corresponding path program 1 times [2019-11-28 15:43:37,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:37,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897039783] [2019-11-28 15:43:37,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-28 15:43:37,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897039783] [2019-11-28 15:43:37,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:37,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:37,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270995428] [2019-11-28 15:43:37,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:37,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:37,416 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-11-28 15:43:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:37,954 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-11-28 15:43:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:37,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 15:43:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:37,961 INFO L225 Difference]: With dead ends: 1709 [2019-11-28 15:43:37,962 INFO L226 Difference]: Without dead ends: 1052 [2019-11-28 15:43:37,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-28 15:43:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-11-28 15:43:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-28 15:43:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-11-28 15:43:38,001 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 156 [2019-11-28 15:43:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:38,001 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-11-28 15:43:38,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-11-28 15:43:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-28 15:43:38,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:38,007 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:38,007 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash -467564647, now seen corresponding path program 1 times [2019-11-28 15:43:38,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:38,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662436093] [2019-11-28 15:43:38,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:43:38,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662436093] [2019-11-28 15:43:38,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:38,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:38,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996931998] [2019-11-28 15:43:38,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:38,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:38,095 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-11-28 15:43:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:38,981 INFO L93 Difference]: Finished difference Result 3281 states and 4154 transitions. [2019-11-28 15:43:38,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:38,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-28 15:43:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:38,998 INFO L225 Difference]: With dead ends: 3281 [2019-11-28 15:43:38,998 INFO L226 Difference]: Without dead ends: 2362 [2019-11-28 15:43:39,001 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:43:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-28 15:43:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-11-28 15:43:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-28 15:43:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-11-28 15:43:39,055 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 165 [2019-11-28 15:43:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:39,055 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-11-28 15:43:39,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-11-28 15:43:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-28 15:43:39,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:39,061 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:39,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 765811402, now seen corresponding path program 1 times [2019-11-28 15:43:39,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:39,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910926405] [2019-11-28 15:43:39,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:43:39,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910926405] [2019-11-28 15:43:39,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:39,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:39,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615193529] [2019-11-28 15:43:39,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:43:39,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:43:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:43:39,197 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-11-28 15:43:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:40,369 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-11-28 15:43:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:40,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-11-28 15:43:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:40,382 INFO L225 Difference]: With dead ends: 3805 [2019-11-28 15:43:40,382 INFO L226 Difference]: Without dead ends: 2231 [2019-11-28 15:43:40,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:43:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-28 15:43:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-11-28 15:43:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-11-28 15:43:40,440 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 171 [2019-11-28 15:43:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:40,440 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-11-28 15:43:40,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:43:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-11-28 15:43:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-28 15:43:40,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:40,446 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:40,447 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1768959985, now seen corresponding path program 1 times [2019-11-28 15:43:40,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:40,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303428066] [2019-11-28 15:43:40,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:43:40,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303428066] [2019-11-28 15:43:40,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:40,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:40,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798409480] [2019-11-28 15:43:40,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:40,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:40,518 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-11-28 15:43:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:41,024 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-11-28 15:43:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:41,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-28 15:43:41,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:41,034 INFO L225 Difference]: With dead ends: 4067 [2019-11-28 15:43:41,034 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:41,037 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:43:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-28 15:43:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-11-28 15:43:41,084 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 174 [2019-11-28 15:43:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:41,085 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-11-28 15:43:41,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-11-28 15:43:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-28 15:43:41,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:41,091 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-28 15:43:41,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1455962891, now seen corresponding path program 1 times [2019-11-28 15:43:41,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:41,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933361325] [2019-11-28 15:43:41,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:43:41,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933361325] [2019-11-28 15:43:41,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:41,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:41,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392484367] [2019-11-28 15:43:41,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:41,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:41,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:41,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:41,223 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-11-28 15:43:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:41,726 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-11-28 15:43:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:41,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-11-28 15:43:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:41,742 INFO L225 Difference]: With dead ends: 3674 [2019-11-28 15:43:41,742 INFO L226 Difference]: Without dead ends: 1838 [2019-11-28 15:43:41,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-28 15:43:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-28 15:43:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-11-28 15:43:41,798 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 189 [2019-11-28 15:43:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:41,799 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-11-28 15:43:41,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-11-28 15:43:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-28 15:43:41,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:41,809 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash -380467305, now seen corresponding path program 1 times [2019-11-28 15:43:41,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:41,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501844208] [2019-11-28 15:43:41,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 15:43:42,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501844208] [2019-11-28 15:43:42,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290037027] [2019-11-28 15:43:42,075 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:43:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:42,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:43:42,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:43:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-28 15:43:42,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:43:42,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-28 15:43:42,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706681200] [2019-11-28 15:43:42,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:42,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:42,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:42,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:43:42,367 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-11-28 15:43:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:42,815 INFO L93 Difference]: Finished difference Result 3936 states and 4310 transitions. [2019-11-28 15:43:42,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:42,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-28 15:43:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:42,825 INFO L225 Difference]: With dead ends: 3936 [2019-11-28 15:43:42,825 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:42,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:43:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-28 15:43:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-28 15:43:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1977 transitions. [2019-11-28 15:43:42,870 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1977 transitions. Word has length 218 [2019-11-28 15:43:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:42,871 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1977 transitions. [2019-11-28 15:43:42,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:42,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1977 transitions. [2019-11-28 15:43:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-28 15:43:42,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:42,882 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:43,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:43,090 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1438607801, now seen corresponding path program 1 times [2019-11-28 15:43:43,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:43,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722966537] [2019-11-28 15:43:43,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:43:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722966537] [2019-11-28 15:43:43,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214560553] [2019-11-28 15:43:43,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:43,539 INFO L264 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:43:43,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:43:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-28 15:43:43,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:43:43,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-28 15:43:43,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330238686] [2019-11-28 15:43:43,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:43,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:43:43,699 INFO L87 Difference]: Start difference. First operand 1838 states and 1977 transitions. Second operand 3 states. [2019-11-28 15:43:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:44,204 INFO L93 Difference]: Finished difference Result 1838 states and 1977 transitions. [2019-11-28 15:43:44,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:44,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-11-28 15:43:44,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:44,206 INFO L225 Difference]: With dead ends: 1838 [2019-11-28 15:43:44,206 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:44,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:43:44,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:44,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2019-11-28 15:43:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:44,210 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:44,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:44,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:44,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:43:44,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:44,654 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-11-28 15:43:44,790 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-11-28 15:43:44,794 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:43:44,794 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:43:44,794 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,794 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,794 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:43:44,795 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,796 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:43:44,797 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,798 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:43:44,799 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:43:44,800 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse5 (= 1 ~a7~0))) (let ((.cse0 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse7 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse2 .cse3 (= ~a16~0 5)) (and .cse5 .cse6 .cse0 .cse4) (and .cse5 .cse6 .cse3) (and .cse7 .cse4 .cse2) (and .cse7 .cse1 .cse2)))) [2019-11-28 15:43:44,800 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,800 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,800 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,800 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,800 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,800 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:43:44,801 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,802 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,803 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:43:44,804 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:43:44,805 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse5 (= 1 ~a7~0))) (let ((.cse0 (not (= ~a16~0 6))) (.cse6 (<= ~a21~0 0)) (.cse3 (= ~a20~0 1)) (.cse4 (= ~a17~0 1)) (.cse7 (not .cse5)) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 .cse3) (and .cse4 .cse2 .cse3) (and .cse2 .cse3 (= ~a16~0 5)) (and .cse5 .cse6 .cse0 .cse4) (and .cse5 .cse6 .cse3) (and .cse7 .cse4 .cse2) (and .cse7 .cse1 .cse2)))) [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:43:44,806 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:43:44,807 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:43:44,808 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:43:44,809 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:43:44,810 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:43:44,811 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:43:44,812 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,813 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:43:44,814 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:43:44,815 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:43:44,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:43:44 BoogieIcfgContainer [2019-11-28 15:43:44,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:43:44,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:43:44,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:43:44,858 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:43:44,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:33" (3/4) ... [2019-11-28 15:43:44,862 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:43:44,899 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:43:44,900 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:43:45,127 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:43:45,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:43:45,129 INFO L168 Benchmark]: Toolchain (without parser) took 14180.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 403.2 MB). Free memory was 951.0 MB in the beginning and 859.2 MB in the end (delta: 91.8 MB). Peak memory consumption was 495.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,129 INFO L168 Benchmark]: CDTParser took 0.31 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:43:45,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.65 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,132 INFO L168 Benchmark]: Boogie Preprocessor took 76.24 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,133 INFO L168 Benchmark]: RCFGBuilder took 1220.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.9 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,133 INFO L168 Benchmark]: TraceAbstraction took 11838.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.3 MB). Free memory was 980.9 MB in the beginning and 871.0 MB in the end (delta: 109.9 MB). Peak memory consumption was 385.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,134 INFO L168 Benchmark]: Witness Printer took 270.20 ms. Allocated memory is still 1.4 GB. Free memory was 871.0 MB in the beginning and 859.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:45,136 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.31 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 671.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.65 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.24 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1220.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.9 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11838.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.3 MB). Free memory was 980.9 MB in the beginning and 871.0 MB in the end (delta: 109.9 MB). Peak memory consumption was 385.2 MB. Max. memory is 11.5 GB. * Witness Printer took 270.20 ms. Allocated memory is still 1.4 GB. Free memory was 871.0 MB in the beginning and 859.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((!(a16 == 6) && a17 <= 0) && a21 == 1) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((!(1 == a7) && a17 <= 0) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((!(a16 == 6) && a17 <= 0) && a21 == 1) || ((a17 <= 0 && a21 == 1) && a20 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((a21 == 1 && a20 == 1) && a16 == 5)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((!(1 == a7) && a17 <= 0) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 860 SDtfs, 1681 SDslu, 76 SDs, 0 SdLazy, 4427 SolverSat, 713 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 506 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, 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, 1312 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 37 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1650 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2326 ConstructedInterpolants, 0 QuantifiedInterpolants, 1007560 SizeOfPredicates, 2 NumberOfNonLiveVariables, 815 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1245/1342 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...