./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label24.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_label24.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 c5fe2c6077c684b4b50af2f6570d6f5c736d513e ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:43:20,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:43:20,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:43:20,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:43:20,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:43:20,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:43:20,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:43:20,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:43:20,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:43:20,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:43:20,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:43:20,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:43:20,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:43:20,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:43:20,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:43:20,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:43:20,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:43:20,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:43:20,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:43:20,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:43:20,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:43:20,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:43:20,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:43:20,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:43:20,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:43:20,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:43:20,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:43:20,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:43:20,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:43:20,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:43:20,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:43:20,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:43:20,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:43:20,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:43:20,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:43:20,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:43:20,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:43:20,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:43:20,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:43:20,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:43:20,782 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:20,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:43:20,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:43:20,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:43:20,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:43:20,802 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:43:20,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:43:20,803 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:43:20,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:43:20,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:43:20,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:43:20,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:43:20,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:43:20,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:43:20,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:43:20,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:43:20,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:43:20,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:43:20,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:43:20,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:43:20,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:43:20,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:43:20,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:43:20,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:43:20,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:43:20,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:43:20,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:43:20,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:43:20,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:43:20,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:43:20,809 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 -> c5fe2c6077c684b4b50af2f6570d6f5c736d513e [2019-11-28 15:43:21,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:43:21,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:43:21,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:43:21,131 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:43:21,132 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:43:21,133 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-28 15:43:21,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbc80dc0/70fe099b2c304fd8982cd90b0f51a041/FLAGed1ec96df [2019-11-28 15:43:21,718 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:43:21,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-28 15:43:21,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbc80dc0/70fe099b2c304fd8982cd90b0f51a041/FLAGed1ec96df [2019-11-28 15:43:21,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbc80dc0/70fe099b2c304fd8982cd90b0f51a041 [2019-11-28 15:43:21,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:43:21,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:43:21,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:21,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:43:21,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:43:21,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:21" (1/1) ... [2019-11-28 15:43:21,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4696e6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:21, skipping insertion in model container [2019-11-28 15:43:21,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:43:21" (1/1) ... [2019-11-28 15:43:21,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:43:22,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:43:22,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:22,645 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:43:22,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:43:22,795 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:43:22,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:22 WrapperNode [2019-11-28 15:43:22,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:43:22,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:22,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:43:22,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:43:22,806 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:22" (1/1) ... [2019-11-28 15:43:22,829 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:22" (1/1) ... [2019-11-28 15:43:22,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:43:22,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:43:22,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:43:22,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:43:22,904 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:22" (1/1) ... [2019-11-28 15:43:22,904 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:22" (1/1) ... [2019-11-28 15:43:22,910 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:22" (1/1) ... [2019-11-28 15:43:22,911 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:22" (1/1) ... [2019-11-28 15:43:22,944 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:22" (1/1) ... [2019-11-28 15:43:22,958 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:22" (1/1) ... [2019-11-28 15:43:22,962 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:22" (1/1) ... [2019-11-28 15:43:22,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:43:22,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:43:22,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:43:22,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:43:22,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:22" (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:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:43:23,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:43:24,254 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:43:24,255 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:43:24,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:24 BoogieIcfgContainer [2019-11-28 15:43:24,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:43:24,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:43:24,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:43:24,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:43:24,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:43:21" (1/3) ... [2019-11-28 15:43:24,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d61ed62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:24, skipping insertion in model container [2019-11-28 15:43:24,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:43:22" (2/3) ... [2019-11-28 15:43:24,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d61ed62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:43:24, skipping insertion in model container [2019-11-28 15:43:24,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:43:24" (3/3) ... [2019-11-28 15:43:24,268 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label24.c [2019-11-28 15:43:24,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:43:24,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:43:24,300 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:43:24,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:43:24,345 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:43:24,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:43:24,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:43:24,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:43:24,347 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:43:24,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:43:24,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:43:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-28 15:43:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-28 15:43:24,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:24,399 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] [2019-11-28 15:43:24,400 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash -342959657, now seen corresponding path program 1 times [2019-11-28 15:43:24,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:24,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513820326] [2019-11-28 15:43:24,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:24,956 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:24,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513820326] [2019-11-28 15:43:24,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:24,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:24,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527317491] [2019-11-28 15:43:24,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:24,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:24,986 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-28 15:43:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:26,358 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-28 15:43:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:26,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-28 15:43:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:26,377 INFO L225 Difference]: With dead ends: 687 [2019-11-28 15:43:26,377 INFO L226 Difference]: Without dead ends: 397 [2019-11-28 15:43:26,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-28 15:43:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-28 15:43:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 15:43:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-28 15:43:26,445 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 98 [2019-11-28 15:43:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:26,446 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-28 15:43:26,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-28 15:43:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:43:26,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:26,451 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:43:26,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash 687887018, now seen corresponding path program 1 times [2019-11-28 15:43:26,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:26,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108036626] [2019-11-28 15:43:26,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:26,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108036626] [2019-11-28 15:43:26,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:26,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:43:26,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360926755] [2019-11-28 15:43:26,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:26,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:26,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:26,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:26,560 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-28 15:43:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:27,334 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-28 15:43:27,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:27,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-28 15:43:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:27,344 INFO L225 Difference]: With dead ends: 1054 [2019-11-28 15:43:27,346 INFO L226 Difference]: Without dead ends: 790 [2019-11-28 15:43:27,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:27,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-28 15:43:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-28 15:43:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 15:43:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-28 15:43:27,423 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 104 [2019-11-28 15:43:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:27,425 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-28 15:43:27,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-28 15:43:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:43:27,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:27,435 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:43:27,435 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash 61656490, now seen corresponding path program 1 times [2019-11-28 15:43:27,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:27,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123839224] [2019-11-28 15:43:27,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:43:27,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123839224] [2019-11-28 15:43:27,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:27,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:27,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215820932] [2019-11-28 15:43:27,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:27,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:27,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:27,637 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-28 15:43:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:28,484 INFO L93 Difference]: Finished difference Result 2626 states and 3534 transitions. [2019-11-28 15:43:28,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:28,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-28 15:43:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:28,497 INFO L225 Difference]: With dead ends: 2626 [2019-11-28 15:43:28,497 INFO L226 Difference]: Without dead ends: 1707 [2019-11-28 15:43:28,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-28 15:43:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1052. [2019-11-28 15:43:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-28 15:43:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1301 transitions. [2019-11-28 15:43:28,548 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1301 transitions. Word has length 105 [2019-11-28 15:43:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:28,549 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1301 transitions. [2019-11-28 15:43:28,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1301 transitions. [2019-11-28 15:43:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:43:28,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:28,555 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] [2019-11-28 15:43:28,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:28,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:28,556 INFO L82 PathProgramCache]: Analyzing trace with hash -320878716, now seen corresponding path program 1 times [2019-11-28 15:43:28,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:28,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429912240] [2019-11-28 15:43:28,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:28,639 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:28,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429912240] [2019-11-28 15:43:28,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:28,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:28,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015165803] [2019-11-28 15:43:28,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:28,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:28,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:28,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:28,674 INFO L87 Difference]: Start difference. First operand 1052 states and 1301 transitions. Second operand 3 states. [2019-11-28 15:43:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:29,112 INFO L93 Difference]: Finished difference Result 2364 states and 2896 transitions. [2019-11-28 15:43:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:29,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:43:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:29,120 INFO L225 Difference]: With dead ends: 2364 [2019-11-28 15:43:29,120 INFO L226 Difference]: Without dead ends: 1183 [2019-11-28 15:43:29,122 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:29,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-28 15:43:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2019-11-28 15:43:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-28 15:43:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1263 transitions. [2019-11-28 15:43:29,160 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1263 transitions. Word has length 121 [2019-11-28 15:43:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:29,160 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1263 transitions. [2019-11-28 15:43:29,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1263 transitions. [2019-11-28 15:43:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 15:43:29,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:29,164 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-11-28 15:43:29,164 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2118438855, now seen corresponding path program 1 times [2019-11-28 15:43:29,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:29,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656134183] [2019-11-28 15:43:29,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-28 15:43:29,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656134183] [2019-11-28 15:43:29,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:29,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:29,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099463742] [2019-11-28 15:43:29,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:29,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:29,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:29,280 INFO L87 Difference]: Start difference. First operand 1052 states and 1263 transitions. Second operand 3 states. [2019-11-28 15:43:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:29,743 INFO L93 Difference]: Finished difference Result 2626 states and 3162 transitions. [2019-11-28 15:43:29,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:29,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-28 15:43:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:29,751 INFO L225 Difference]: With dead ends: 2626 [2019-11-28 15:43:29,751 INFO L226 Difference]: Without dead ends: 1445 [2019-11-28 15:43:29,753 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:29,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-28 15:43:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-28 15:43:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-28 15:43:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1455 transitions. [2019-11-28 15:43:29,782 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1455 transitions. Word has length 132 [2019-11-28 15:43:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:29,782 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1455 transitions. [2019-11-28 15:43:29,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1455 transitions. [2019-11-28 15:43:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-28 15:43:29,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:29,786 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-28 15:43:29,786 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:29,786 INFO L82 PathProgramCache]: Analyzing trace with hash -909410889, now seen corresponding path program 1 times [2019-11-28 15:43:29,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:29,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845903766] [2019-11-28 15:43:29,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:29,857 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 15:43:29,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845903766] [2019-11-28 15:43:29,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:29,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:29,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544618514] [2019-11-28 15:43:29,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:29,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:29,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:29,860 INFO L87 Difference]: Start difference. First operand 1314 states and 1455 transitions. Second operand 3 states. [2019-11-28 15:43:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:30,292 INFO L93 Difference]: Finished difference Result 3281 states and 3647 transitions. [2019-11-28 15:43:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:30,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-28 15:43:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:30,303 INFO L225 Difference]: With dead ends: 3281 [2019-11-28 15:43:30,303 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:30,307 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:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-28 15:43:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-28 15:43:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1884 transitions. [2019-11-28 15:43:30,362 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1884 transitions. Word has length 151 [2019-11-28 15:43:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:30,363 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1884 transitions. [2019-11-28 15:43:30,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1884 transitions. [2019-11-28 15:43:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-28 15:43:30,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:30,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,371 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1082991010, now seen corresponding path program 1 times [2019-11-28 15:43:30,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:30,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071397281] [2019-11-28 15:43:30,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:30,467 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:30,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071397281] [2019-11-28 15:43:30,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:30,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:43:30,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888820050] [2019-11-28 15:43:30,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:43:30,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:30,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:43:30,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:43:30,479 INFO L87 Difference]: Start difference. First operand 1707 states and 1884 transitions. Second operand 3 states. [2019-11-28 15:43:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:30,943 INFO L93 Difference]: Finished difference Result 3674 states and 4051 transitions. [2019-11-28 15:43:30,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:30,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-28 15:43:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:30,956 INFO L225 Difference]: With dead ends: 3674 [2019-11-28 15:43:30,956 INFO L226 Difference]: Without dead ends: 1969 [2019-11-28 15:43:30,959 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:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-28 15:43:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-11-28 15:43:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2159 transitions. [2019-11-28 15:43:31,025 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2159 transitions. Word has length 154 [2019-11-28 15:43:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:31,025 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2159 transitions. [2019-11-28 15:43:31,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:43:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2159 transitions. [2019-11-28 15:43:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-28 15:43:31,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:31,031 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-28 15:43:31,032 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:31,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:31,032 INFO L82 PathProgramCache]: Analyzing trace with hash -162013546, now seen corresponding path program 1 times [2019-11-28 15:43:31,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:31,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151359052] [2019-11-28 15:43:31,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-28 15:43:31,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151359052] [2019-11-28 15:43:31,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:31,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 15:43:31,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215924343] [2019-11-28 15:43:31,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:43:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:43:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:31,276 INFO L87 Difference]: Start difference. First operand 1969 states and 2159 transitions. Second operand 6 states. [2019-11-28 15:43:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:32,333 INFO L93 Difference]: Finished difference Result 3939 states and 4332 transitions. [2019-11-28 15:43:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:43:32,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-11-28 15:43:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:32,341 INFO L225 Difference]: With dead ends: 3939 [2019-11-28 15:43:32,341 INFO L226 Difference]: Without dead ends: 2103 [2019-11-28 15:43:32,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:43:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-11-28 15:43:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1969. [2019-11-28 15:43:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2145 transitions. [2019-11-28 15:43:32,384 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2145 transitions. Word has length 158 [2019-11-28 15:43:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:32,384 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2145 transitions. [2019-11-28 15:43:32,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:43:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2145 transitions. [2019-11-28 15:43:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-28 15:43:32,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:32,390 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] [2019-11-28 15:43:32,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1222057446, now seen corresponding path program 1 times [2019-11-28 15:43:32,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:32,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550174364] [2019-11-28 15:43:32,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-28 15:43:32,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550174364] [2019-11-28 15:43:32,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:32,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:32,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384913304] [2019-11-28 15:43:32,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:32,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:32,549 INFO L87 Difference]: Start difference. First operand 1969 states and 2145 transitions. Second operand 4 states. [2019-11-28 15:43:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:33,182 INFO L93 Difference]: Finished difference Result 4198 states and 4572 transitions. [2019-11-28 15:43:33,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:33,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-28 15:43:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:33,192 INFO L225 Difference]: With dead ends: 4198 [2019-11-28 15:43:33,192 INFO L226 Difference]: Without dead ends: 2100 [2019-11-28 15:43:33,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-28 15:43:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-28 15:43:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2103 transitions. [2019-11-28 15:43:33,236 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2103 transitions. Word has length 191 [2019-11-28 15:43:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:33,236 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2103 transitions. [2019-11-28 15:43:33,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2103 transitions. [2019-11-28 15:43:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-28 15:43:33,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:33,245 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:43:33,245 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1413978792, now seen corresponding path program 1 times [2019-11-28 15:43:33,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:33,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597965680] [2019-11-28 15:43:33,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-28 15:43:33,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597965680] [2019-11-28 15:43:33,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:33,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:33,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421004036] [2019-11-28 15:43:33,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:33,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:33,484 INFO L87 Difference]: Start difference. First operand 1969 states and 2103 transitions. Second operand 4 states. [2019-11-28 15:43:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:34,328 INFO L93 Difference]: Finished difference Result 3936 states and 4206 transitions. [2019-11-28 15:43:34,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:43:34,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-28 15:43:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:34,344 INFO L225 Difference]: With dead ends: 3936 [2019-11-28 15:43:34,344 INFO L226 Difference]: Without dead ends: 2100 [2019-11-28 15:43:34,350 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:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-28 15:43:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-28 15:43:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2102 transitions. [2019-11-28 15:43:34,407 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2102 transitions. Word has length 197 [2019-11-28 15:43:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:34,407 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2102 transitions. [2019-11-28 15:43:34,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2102 transitions. [2019-11-28 15:43:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-28 15:43:34,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:34,414 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,414 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:34,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1798112851, now seen corresponding path program 1 times [2019-11-28 15:43:34,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:34,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885557313] [2019-11-28 15:43:34,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-28 15:43:34,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885557313] [2019-11-28 15:43:34,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:34,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:43:34,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120949240] [2019-11-28 15:43:34,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:43:34,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:43:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:34,641 INFO L87 Difference]: Start difference. First operand 1969 states and 2102 transitions. Second operand 6 states. [2019-11-28 15:43:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:35,318 INFO L93 Difference]: Finished difference Result 3971 states and 4248 transitions. [2019-11-28 15:43:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:43:35,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-11-28 15:43:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:35,328 INFO L225 Difference]: With dead ends: 3971 [2019-11-28 15:43:35,328 INFO L226 Difference]: Without dead ends: 2135 [2019-11-28 15:43:35,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:43:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-11-28 15:43:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1969. [2019-11-28 15:43:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-28 15:43:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2088 transitions. [2019-11-28 15:43:35,379 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2088 transitions. Word has length 218 [2019-11-28 15:43:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:35,380 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2088 transitions. [2019-11-28 15:43:35,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:43:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2088 transitions. [2019-11-28 15:43:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-28 15:43:35,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:43:35,385 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 15:43:35,386 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:43:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:43:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash -392691734, now seen corresponding path program 1 times [2019-11-28 15:43:35,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:43:35,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576574515] [2019-11-28 15:43:35,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:43:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:43:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-28 15:43:35,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576574515] [2019-11-28 15:43:35,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:43:35,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:43:35,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028269018] [2019-11-28 15:43:35,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:43:35,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:43:35,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:43:35,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:43:35,585 INFO L87 Difference]: Start difference. First operand 1969 states and 2088 transitions. Second operand 4 states. [2019-11-28 15:43:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:43:36,059 INFO L93 Difference]: Finished difference Result 3803 states and 4039 transitions. [2019-11-28 15:43:36,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:43:36,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-28 15:43:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:43:36,061 INFO L225 Difference]: With dead ends: 3803 [2019-11-28 15:43:36,062 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:43:36,066 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:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:43:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:43:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:43:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:43:36,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-28 15:43:36,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:43:36,067 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:43:36,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:43:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:43:36,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:43:36,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:43:36,575 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-28 15:43:36,846 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,850 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-28 15:43:36,851 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-28 15:43:36,852 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-28 15:43:36,853 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-28 15:43:36,854 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-28 15:43:36,855 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-28 15:43:36,855 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-28 15:43:36,855 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-28 15:43:36,855 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-28 15:43:36,855 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-28 15:43:36,855 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-28 15:43:36,857 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-28 15:43:36,857 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,857 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,857 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,857 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-28 15:43:36,858 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,859 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,860 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:43:36,861 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-28 15:43:36,862 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-28 15:43:36,862 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-28 15:43:36,862 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-28 15:43:36,862 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-28 15:43:36,862 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-28 15:43:36,862 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,863 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-28 15:43:36,863 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,863 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,863 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,864 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,864 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-28 15:43:36,864 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-28 15:43:36,864 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-28 15:43:36,864 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-28 15:43:36,864 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-28 15:43:36,865 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-28 15:43:36,865 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-28 15:43:36,865 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-28 15:43:36,865 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,865 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-28 15:43:36,866 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-28 15:43:36,867 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-28 15:43:36,867 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-28 15:43:36,867 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-28 15:43:36,867 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-28 15:43:36,867 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-28 15:43:36,868 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-28 15:43:36,868 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-28 15:43:36,868 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-28 15:43:36,868 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-28 15:43:36,869 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,869 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,869 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,869 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,870 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-28 15:43:36,870 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,870 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,870 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-28 15:43:36,871 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-28 15:43:36,871 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:43:36,871 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-28 15:43:36,871 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-28 15:43:36,872 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-28 15:43:36,872 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-28 15:43:36,872 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-28 15:43:36,872 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-28 15:43:36,872 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-28 15:43:36,873 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-28 15:43:36,873 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-28 15:43:36,873 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-28 15:43:36,873 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,873 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,874 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,874 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,874 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,874 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-28 15:43:36,874 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,874 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-28 15:43:36,875 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-28 15:43:36,875 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-28 15:43:36,875 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-28 15:43:36,875 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-28 15:43:36,875 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-28 15:43:36,875 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-28 15:43:36,876 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-28 15:43:36,876 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-28 15:43:36,876 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-28 15:43:36,876 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-28 15:43:36,876 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:43:36,876 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2019-11-28 15:43:36,877 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-28 15:43:36,877 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-28 15:43:36,877 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-28 15:43:36,877 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,878 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,878 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,878 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,878 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,878 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-28 15:43:36,879 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-28 15:43:36,879 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-28 15:43:36,879 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-28 15:43:36,879 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-28 15:43:36,880 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-28 15:43:36,880 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-28 15:43:36,880 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-28 15:43:36,880 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-28 15:43:36,881 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-28 15:43:36,881 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-28 15:43:36,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:43:36 BoogieIcfgContainer [2019-11-28 15:43:36,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:43:36,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:43:36,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:43:36,909 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:43:36,910 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:24" (3/4) ... [2019-11-28 15:43:36,914 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:43:36,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:43:36,936 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:43:37,120 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:43:37,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:43:37,122 INFO L168 Benchmark]: Toolchain (without parser) took 15157.09 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 437.8 MB). Free memory was 955.0 MB in the beginning and 1.3 GB in the end (delta: -380.5 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,122 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:43:37,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.49 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,123 INFO L168 Benchmark]: Boogie Preprocessor took 75.88 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,123 INFO L168 Benchmark]: RCFGBuilder took 1286.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,124 INFO L168 Benchmark]: TraceAbstraction took 12650.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.1 MB). Free memory was 998.8 MB in the beginning and 1.3 GB in the end (delta: -348.8 MB). Peak memory consumption was 479.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,124 INFO L168 Benchmark]: Witness Printer took 211.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:43:37,126 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.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 830.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -168.6 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.49 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.88 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1286.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 111.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12650.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.1 MB). Free memory was 998.8 MB in the beginning and 1.3 GB in the end (delta: -348.8 MB). Peak memory consumption was 479.6 MB. Max. memory is 11.5 GB. * Witness Printer took 211.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 470]: 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) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.7s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 945 SDtfs, 2556 SDslu, 142 SDs, 0 SdLazy, 6367 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1872 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 489 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2761 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 680171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1309/1309 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...