./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.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 3ce72b7e5333914b2e09c2dde7071fc003367434 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:33:53,177 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:33:53,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:33:53,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:33:53,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:33:53,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:33:53,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:33:53,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:33:53,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:33:53,215 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:33:53,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:33:53,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:33:53,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:33:53,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:33:53,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:33:53,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:33:53,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:33:53,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:33:53,234 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:33:53,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:33:53,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:33:53,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:33:53,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:33:53,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:33:53,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:33:53,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:33:53,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:33:53,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:33:53,250 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:33:53,254 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:33:53,254 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:33:53,256 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:33:53,256 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:33:53,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:33:53,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:33:53,258 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:33:53,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:33:53,276 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:33:53,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:33:53,278 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:33:53,278 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:33:53,278 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:33:53,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:33:53,279 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:33:53,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:33:53,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:33:53,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:33:53,279 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:33:53,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:33:53,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:33:53,280 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:33:53,280 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:33:53,280 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:33:53,280 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:33:53,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:33:53,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:33:53,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:33:53,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:33:53,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:33:53,281 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:33:53,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:33:53,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:33:53,282 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:33:53,282 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:33:53,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:33:53,282 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 3ce72b7e5333914b2e09c2dde7071fc003367434 [2019-01-12 04:33:53,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:33:53,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:33:53,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:33:53,355 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:33:53,355 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:33:53,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.c [2019-01-12 04:33:53,413 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec9ff5bc/1b18cb5d9cff4a778284b5e8cd38b9ce/FLAG0c9b6b791 [2019-01-12 04:33:54,033 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:33:54,034 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label24_true-unreach-call.c [2019-01-12 04:33:54,057 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec9ff5bc/1b18cb5d9cff4a778284b5e8cd38b9ce/FLAG0c9b6b791 [2019-01-12 04:33:54,209 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ec9ff5bc/1b18cb5d9cff4a778284b5e8cd38b9ce [2019-01-12 04:33:54,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:33:54,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:33:54,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:33:54,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:33:54,221 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:33:54,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:33:54" (1/1) ... [2019-01-12 04:33:54,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a621260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:54, skipping insertion in model container [2019-01-12 04:33:54,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:33:54" (1/1) ... [2019-01-12 04:33:54,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:33:54,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:33:55,065 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:33:55,071 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:33:55,467 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:33:55,654 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:33:55,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55 WrapperNode [2019-01-12 04:33:55,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:33:55,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:33:55,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:33:55,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:33:55,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:33:55,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:33:55,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:33:55,854 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:33:55,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:55,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:56,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (1/1) ... [2019-01-12 04:33:56,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:33:56,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:33:56,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:33:56,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:33:56,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (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-01-12 04:33:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:33:56,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:34:03,745 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:34:03,745 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:34:03,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:03 BoogieIcfgContainer [2019-01-12 04:34:03,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:34:03,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:34:03,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:34:03,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:34:03,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:33:54" (1/3) ... [2019-01-12 04:34:03,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475785a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:03, skipping insertion in model container [2019-01-12 04:34:03,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:33:55" (2/3) ... [2019-01-12 04:34:03,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475785a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:03, skipping insertion in model container [2019-01-12 04:34:03,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:03" (3/3) ... [2019-01-12 04:34:03,754 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label24_true-unreach-call.c [2019-01-12 04:34:03,762 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:34:03,772 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:34:03,790 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:34:03,827 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:34:03,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:34:03,828 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:34:03,828 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:34:03,829 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:34:03,829 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:34:03,829 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:34:03,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:34:03,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:34:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:34:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 04:34:03,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:03,867 INFO L402 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] [2019-01-12 04:34:03,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2019-01-12 04:34:03,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:03,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:03,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:04,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:04,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:04,360 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:34:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:12,788 INFO L93 Difference]: Finished difference Result 1466 states and 2715 transitions. [2019-01-12 04:34:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:12,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-01-12 04:34:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:12,817 INFO L225 Difference]: With dead ends: 1466 [2019-01-12 04:34:12,817 INFO L226 Difference]: Without dead ends: 974 [2019-01-12 04:34:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-01-12 04:34:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2019-01-12 04:34:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-01-12 04:34:12,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1407 transitions. [2019-01-12 04:34:12,937 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1407 transitions. Word has length 38 [2019-01-12 04:34:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:12,937 INFO L480 AbstractCegarLoop]: Abstraction has 972 states and 1407 transitions. [2019-01-12 04:34:12,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1407 transitions. [2019-01-12 04:34:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 04:34:12,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:12,942 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:12,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1506218363, now seen corresponding path program 1 times [2019-01-12 04:34:12,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:12,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:12,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:12,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:13,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:13,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:13,370 INFO L87 Difference]: Start difference. First operand 972 states and 1407 transitions. Second operand 4 states. [2019-01-12 04:34:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:18,594 INFO L93 Difference]: Finished difference Result 3751 states and 5444 transitions. [2019-01-12 04:34:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:18,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 04:34:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:18,612 INFO L225 Difference]: With dead ends: 3751 [2019-01-12 04:34:18,612 INFO L226 Difference]: Without dead ends: 2781 [2019-01-12 04:34:18,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2019-01-12 04:34:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2477. [2019-01-12 04:34:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-01-12 04:34:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3302 transitions. [2019-01-12 04:34:18,693 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3302 transitions. Word has length 103 [2019-01-12 04:34:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:18,694 INFO L480 AbstractCegarLoop]: Abstraction has 2477 states and 3302 transitions. [2019-01-12 04:34:18,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3302 transitions. [2019-01-12 04:34:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-12 04:34:18,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:18,707 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:34:18,707 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1376091177, now seen corresponding path program 1 times [2019-01-12 04:34:18,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:18,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:18,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:18,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-12 04:34:19,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:19,169 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:34:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:19,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:19,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:34:19,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:34:19,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:19,433 INFO L87 Difference]: Start difference. First operand 2477 states and 3302 transitions. Second operand 4 states. [2019-01-12 04:34:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:24,414 INFO L93 Difference]: Finished difference Result 9147 states and 12151 transitions. [2019-01-12 04:34:24,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:24,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 248 [2019-01-12 04:34:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:24,455 INFO L225 Difference]: With dead ends: 9147 [2019-01-12 04:34:24,456 INFO L226 Difference]: Without dead ends: 6672 [2019-01-12 04:34:24,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2019-01-12 04:34:24,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 2775. [2019-01-12 04:34:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2775 states. [2019-01-12 04:34:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3654 transitions. [2019-01-12 04:34:24,540 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3654 transitions. Word has length 248 [2019-01-12 04:34:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:24,542 INFO L480 AbstractCegarLoop]: Abstraction has 2775 states and 3654 transitions. [2019-01-12 04:34:24,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3654 transitions. [2019-01-12 04:34:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-12 04:34:24,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:24,548 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:34:24,548 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2068910714, now seen corresponding path program 1 times [2019-01-12 04:34:24,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:24,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:24,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:24,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:24,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-12 04:34:25,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:25,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:25,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:34:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:34:25,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:34:25,197 INFO L87 Difference]: Start difference. First operand 2775 states and 3654 transitions. Second operand 5 states. [2019-01-12 04:34:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:29,151 INFO L93 Difference]: Finished difference Result 6746 states and 8608 transitions. [2019-01-12 04:34:29,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:29,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 315 [2019-01-12 04:34:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:29,169 INFO L225 Difference]: With dead ends: 6746 [2019-01-12 04:34:29,170 INFO L226 Difference]: Without dead ends: 3973 [2019-01-12 04:34:29,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:34:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2019-01-12 04:34:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3673. [2019-01-12 04:34:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-01-12 04:34:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4606 transitions. [2019-01-12 04:34:29,238 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4606 transitions. Word has length 315 [2019-01-12 04:34:29,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:29,238 INFO L480 AbstractCegarLoop]: Abstraction has 3673 states and 4606 transitions. [2019-01-12 04:34:29,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:34:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4606 transitions. [2019-01-12 04:34:29,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-01-12 04:34:29,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:29,247 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:34:29,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:29,247 INFO L82 PathProgramCache]: Analyzing trace with hash 22793460, now seen corresponding path program 1 times [2019-01-12 04:34:29,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:29,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:29,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:29,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:29,897 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:34:30,290 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-12 04:34:30,474 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2019-01-12 04:34:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:31,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:31,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:34:31,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:31,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:34:31,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:34:31,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:34:31,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:34:31,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:34:31,251 INFO L87 Difference]: Start difference. First operand 3673 states and 4606 transitions. Second operand 9 states. [2019-01-12 04:34:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:40,680 INFO L93 Difference]: Finished difference Result 8892 states and 11158 transitions. [2019-01-12 04:34:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:34:40,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 389 [2019-01-12 04:34:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:40,706 INFO L225 Difference]: With dead ends: 8892 [2019-01-12 04:34:40,707 INFO L226 Difference]: Without dead ends: 5221 [2019-01-12 04:34:40,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 392 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:34:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2019-01-12 04:34:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4571. [2019-01-12 04:34:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2019-01-12 04:34:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 5459 transitions. [2019-01-12 04:34:40,805 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 5459 transitions. Word has length 389 [2019-01-12 04:34:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:40,807 INFO L480 AbstractCegarLoop]: Abstraction has 4571 states and 5459 transitions. [2019-01-12 04:34:40,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:34:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 5459 transitions. [2019-01-12 04:34:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-01-12 04:34:40,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:40,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:40,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1836310355, now seen corresponding path program 1 times [2019-01-12 04:34:40,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:40,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:40,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:40,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:34:41,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:41,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:34:41,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:41,491 INFO L87 Difference]: Start difference. First operand 4571 states and 5459 transitions. Second operand 4 states. [2019-01-12 04:34:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:44,931 INFO L93 Difference]: Finished difference Result 10036 states and 12084 transitions. [2019-01-12 04:34:44,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:44,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2019-01-12 04:34:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:44,952 INFO L225 Difference]: With dead ends: 10036 [2019-01-12 04:34:44,953 INFO L226 Difference]: Without dead ends: 5467 [2019-01-12 04:34:44,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:44,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-01-12 04:34:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5465. [2019-01-12 04:34:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2019-01-12 04:34:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 6392 transitions. [2019-01-12 04:34:45,053 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 6392 transitions. Word has length 407 [2019-01-12 04:34:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:45,053 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 6392 transitions. [2019-01-12 04:34:45,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 6392 transitions. [2019-01-12 04:34:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-01-12 04:34:45,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:45,066 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:34:45,067 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:45,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash 365821965, now seen corresponding path program 1 times [2019-01-12 04:34:45,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:45,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:45,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:45,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:45,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:34:45,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:45,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:45,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:34:45,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:34:45,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:45,485 INFO L87 Difference]: Start difference. First operand 5465 states and 6392 transitions. Second operand 3 states. [2019-01-12 04:34:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:48,762 INFO L93 Difference]: Finished difference Result 12721 states and 15122 transitions. [2019-01-12 04:34:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:34:48,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-01-12 04:34:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:48,792 INFO L225 Difference]: With dead ends: 12721 [2019-01-12 04:34:48,792 INFO L226 Difference]: Without dead ends: 7258 [2019-01-12 04:34:48,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:34:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7258 states. [2019-01-12 04:34:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7258 to 7258. [2019-01-12 04:34:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7258 states. [2019-01-12 04:34:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7258 states to 7258 states and 8466 transitions. [2019-01-12 04:34:48,916 INFO L78 Accepts]: Start accepts. Automaton has 7258 states and 8466 transitions. Word has length 502 [2019-01-12 04:34:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:48,917 INFO L480 AbstractCegarLoop]: Abstraction has 7258 states and 8466 transitions. [2019-01-12 04:34:48,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:34:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7258 states and 8466 transitions. [2019-01-12 04:34:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-01-12 04:34:48,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:48,936 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:34:48,938 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:48,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:48,938 INFO L82 PathProgramCache]: Analyzing trace with hash -765323433, now seen corresponding path program 1 times [2019-01-12 04:34:48,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:48,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:48,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:48,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:48,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 604 proven. 3 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-12 04:34:50,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:34:50,075 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:34:50,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:50,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:34:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 799 backedges. 568 proven. 39 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-01-12 04:34:51,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:34:51,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-12 04:34:51,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:34:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:34:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:34:51,228 INFO L87 Difference]: Start difference. First operand 7258 states and 8466 transitions. Second operand 9 states. [2019-01-12 04:35:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:02,092 INFO L93 Difference]: Finished difference Result 19453 states and 22363 transitions. [2019-01-12 04:35:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:35:02,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 593 [2019-01-12 04:35:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:02,114 INFO L225 Difference]: With dead ends: 19453 [2019-01-12 04:35:02,115 INFO L226 Difference]: Without dead ends: 9051 [2019-01-12 04:35:02,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:35:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9051 states. [2019-01-12 04:35:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9051 to 6658. [2019-01-12 04:35:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6658 states. [2019-01-12 04:35:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 7070 transitions. [2019-01-12 04:35:02,221 INFO L78 Accepts]: Start accepts. Automaton has 6658 states and 7070 transitions. Word has length 593 [2019-01-12 04:35:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:02,221 INFO L480 AbstractCegarLoop]: Abstraction has 6658 states and 7070 transitions. [2019-01-12 04:35:02,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:35:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6658 states and 7070 transitions. [2019-01-12 04:35:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-01-12 04:35:02,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:02,231 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:35:02,231 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 157467247, now seen corresponding path program 1 times [2019-01-12 04:35:02,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:02,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:02,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:02,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:02,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2019-01-12 04:35:02,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:02,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:02,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:02,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:02,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:02,610 INFO L87 Difference]: Start difference. First operand 6658 states and 7070 transitions. Second operand 3 states. [2019-01-12 04:35:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:04,288 INFO L93 Difference]: Finished difference Result 13312 states and 14136 transitions. [2019-01-12 04:35:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:04,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 635 [2019-01-12 04:35:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:04,300 INFO L225 Difference]: With dead ends: 13312 [2019-01-12 04:35:04,300 INFO L226 Difference]: Without dead ends: 6656 [2019-01-12 04:35:04,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6656 states. [2019-01-12 04:35:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6656 to 6656. [2019-01-12 04:35:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-01-12 04:35:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7066 transitions. [2019-01-12 04:35:04,384 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7066 transitions. Word has length 635 [2019-01-12 04:35:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:04,385 INFO L480 AbstractCegarLoop]: Abstraction has 6656 states and 7066 transitions. [2019-01-12 04:35:04,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7066 transitions. [2019-01-12 04:35:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 671 [2019-01-12 04:35:04,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:04,394 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:35:04,394 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:04,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:04,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1236683574, now seen corresponding path program 1 times [2019-01-12 04:35:04,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:04,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:04,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:35:05,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:05,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:05,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:05,137 INFO L87 Difference]: Start difference. First operand 6656 states and 7066 transitions. Second operand 4 states. [2019-01-12 04:35:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:07,404 INFO L93 Difference]: Finished difference Result 18401 states and 19606 transitions. [2019-01-12 04:35:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:07,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 670 [2019-01-12 04:35:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:07,428 INFO L225 Difference]: With dead ends: 18401 [2019-01-12 04:35:07,428 INFO L226 Difference]: Without dead ends: 11747 [2019-01-12 04:35:07,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11747 states. [2019-01-12 04:35:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11747 to 8451. [2019-01-12 04:35:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8451 states. [2019-01-12 04:35:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8451 states to 8451 states and 8974 transitions. [2019-01-12 04:35:07,555 INFO L78 Accepts]: Start accepts. Automaton has 8451 states and 8974 transitions. Word has length 670 [2019-01-12 04:35:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:07,556 INFO L480 AbstractCegarLoop]: Abstraction has 8451 states and 8974 transitions. [2019-01-12 04:35:07,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 8451 states and 8974 transitions. [2019-01-12 04:35:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-01-12 04:35:07,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:07,568 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:07,568 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:07,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2142648817, now seen corresponding path program 1 times [2019-01-12 04:35:07,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:07,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 589 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-01-12 04:35:08,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:08,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:35:08,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:08,132 INFO L87 Difference]: Start difference. First operand 8451 states and 8974 transitions. Second operand 5 states. [2019-01-12 04:35:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:11,501 INFO L93 Difference]: Finished difference Result 21095 states and 22468 transitions. [2019-01-12 04:35:11,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:35:11,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 696 [2019-01-12 04:35:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:11,520 INFO L225 Difference]: With dead ends: 21095 [2019-01-12 04:35:11,520 INFO L226 Difference]: Without dead ends: 12048 [2019-01-12 04:35:11,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12048 states. [2019-01-12 04:35:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12048 to 9645. [2019-01-12 04:35:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9645 states. [2019-01-12 04:35:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 10139 transitions. [2019-01-12 04:35:11,662 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 10139 transitions. Word has length 696 [2019-01-12 04:35:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:11,664 INFO L480 AbstractCegarLoop]: Abstraction has 9645 states and 10139 transitions. [2019-01-12 04:35:11,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:11,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 10139 transitions. [2019-01-12 04:35:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2019-01-12 04:35:11,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:11,676 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 04:35:11,676 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1681321076, now seen corresponding path program 1 times [2019-01-12 04:35:11,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:11,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-01-12 04:35:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:35:12,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:12,556 INFO L87 Difference]: Start difference. First operand 9645 states and 10139 transitions. Second operand 5 states. [2019-01-12 04:35:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:15,215 INFO L93 Difference]: Finished difference Result 22584 states and 23736 transitions. [2019-01-12 04:35:15,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:35:15,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 707 [2019-01-12 04:35:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:15,231 INFO L225 Difference]: With dead ends: 22584 [2019-01-12 04:35:15,232 INFO L226 Difference]: Without dead ends: 12941 [2019-01-12 04:35:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12941 states. [2019-01-12 04:35:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12941 to 8748. [2019-01-12 04:35:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8748 states. [2019-01-12 04:35:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8748 states to 8748 states and 9158 transitions. [2019-01-12 04:35:15,365 INFO L78 Accepts]: Start accepts. Automaton has 8748 states and 9158 transitions. Word has length 707 [2019-01-12 04:35:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:15,366 INFO L480 AbstractCegarLoop]: Abstraction has 8748 states and 9158 transitions. [2019-01-12 04:35:15,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8748 states and 9158 transitions. [2019-01-12 04:35:15,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2019-01-12 04:35:15,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:15,378 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:15,379 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1870325008, now seen corresponding path program 1 times [2019-01-12 04:35:15,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:15,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:15,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:15,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:15,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:15,957 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:35:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 36 proven. 537 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-01-12 04:35:16,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:16,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:35:16,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:17,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:17,440 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 19 [2019-01-12 04:35:18,036 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 04:35:18,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:18,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:35:18,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:35:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:35:18,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:35:18,059 INFO L87 Difference]: Start difference. First operand 8748 states and 9158 transitions. Second operand 7 states. [2019-01-12 04:35:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:40,362 INFO L93 Difference]: Finished difference Result 31597 states and 32965 transitions. [2019-01-12 04:35:40,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:35:40,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 760 [2019-01-12 04:35:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:40,381 INFO L225 Difference]: With dead ends: 31597 [2019-01-12 04:35:40,381 INFO L226 Difference]: Without dead ends: 22552 [2019-01-12 04:35:40,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:35:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22552 states. [2019-01-12 04:35:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22552 to 14444. [2019-01-12 04:35:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14444 states. [2019-01-12 04:35:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 15043 transitions. [2019-01-12 04:35:40,635 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 15043 transitions. Word has length 760 [2019-01-12 04:35:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:40,636 INFO L480 AbstractCegarLoop]: Abstraction has 14444 states and 15043 transitions. [2019-01-12 04:35:40,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:35:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 15043 transitions. [2019-01-12 04:35:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2019-01-12 04:35:40,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:40,652 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:40,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:40,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1517974008, now seen corresponding path program 1 times [2019-01-12 04:35:40,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:40,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:40,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:40,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 957 backedges. 505 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-01-12 04:35:41,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:41,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:41,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:41,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:41,405 INFO L87 Difference]: Start difference. First operand 14444 states and 15043 transitions. Second operand 3 states. [2019-01-12 04:35:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:43,030 INFO L93 Difference]: Finished difference Result 24657 states and 25652 transitions. [2019-01-12 04:35:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:43,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 767 [2019-01-12 04:35:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:43,041 INFO L225 Difference]: With dead ends: 24657 [2019-01-12 04:35:43,041 INFO L226 Difference]: Without dead ends: 10215 [2019-01-12 04:35:43,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10215 states. [2019-01-12 04:35:43,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10215 to 8717. [2019-01-12 04:35:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8717 states. [2019-01-12 04:35:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8717 states to 8717 states and 9002 transitions. [2019-01-12 04:35:43,146 INFO L78 Accepts]: Start accepts. Automaton has 8717 states and 9002 transitions. Word has length 767 [2019-01-12 04:35:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 8717 states and 9002 transitions. [2019-01-12 04:35:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8717 states and 9002 transitions. [2019-01-12 04:35:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2019-01-12 04:35:43,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:43,157 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:35:43,158 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1315496286, now seen corresponding path program 1 times [2019-01-12 04:35:43,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:43,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:43,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1016 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-01-12 04:35:44,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:44,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:44,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:44,275 INFO L87 Difference]: Start difference. First operand 8717 states and 9002 transitions. Second operand 3 states. [2019-01-12 04:35:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:45,560 INFO L93 Difference]: Finished difference Result 19533 states and 20175 transitions. [2019-01-12 04:35:45,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:45,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 862 [2019-01-12 04:35:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:45,570 INFO L225 Difference]: With dead ends: 19533 [2019-01-12 04:35:45,571 INFO L226 Difference]: Without dead ends: 10818 [2019-01-12 04:35:45,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10818 states. [2019-01-12 04:35:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10818 to 10216. [2019-01-12 04:35:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10216 states. [2019-01-12 04:35:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10216 states to 10216 states and 10524 transitions. [2019-01-12 04:35:45,688 INFO L78 Accepts]: Start accepts. Automaton has 10216 states and 10524 transitions. Word has length 862 [2019-01-12 04:35:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:45,689 INFO L480 AbstractCegarLoop]: Abstraction has 10216 states and 10524 transitions. [2019-01-12 04:35:45,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 10216 states and 10524 transitions. [2019-01-12 04:35:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2019-01-12 04:35:45,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:45,703 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:35:45,703 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash -310586294, now seen corresponding path program 1 times [2019-01-12 04:35:45,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:45,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:45,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:45,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-01-12 04:35:46,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:46,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:46,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:46,778 INFO L87 Difference]: Start difference. First operand 10216 states and 10524 transitions. Second operand 4 states. [2019-01-12 04:35:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:48,524 INFO L93 Difference]: Finished difference Result 18927 states and 19508 transitions. [2019-01-12 04:35:48,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:48,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 936 [2019-01-12 04:35:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:48,532 INFO L225 Difference]: With dead ends: 18927 [2019-01-12 04:35:48,532 INFO L226 Difference]: Without dead ends: 9012 [2019-01-12 04:35:48,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9012 states. [2019-01-12 04:35:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9012 to 8111. [2019-01-12 04:35:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8111 states. [2019-01-12 04:35:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8111 states to 8111 states and 8278 transitions. [2019-01-12 04:35:48,634 INFO L78 Accepts]: Start accepts. Automaton has 8111 states and 8278 transitions. Word has length 936 [2019-01-12 04:35:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:48,635 INFO L480 AbstractCegarLoop]: Abstraction has 8111 states and 8278 transitions. [2019-01-12 04:35:48,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8111 states and 8278 transitions. [2019-01-12 04:35:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-01-12 04:35:48,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:48,649 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:35:48,649 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:48,650 INFO L82 PathProgramCache]: Analyzing trace with hash -321067316, now seen corresponding path program 1 times [2019-01-12 04:35:48,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:48,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:48,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:48,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1794 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1615 trivial. 0 not checked. [2019-01-12 04:35:50,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:50,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:35:50,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:35:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:35:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:50,224 INFO L87 Difference]: Start difference. First operand 8111 states and 8278 transitions. Second operand 3 states. [2019-01-12 04:35:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:51,337 INFO L93 Difference]: Finished difference Result 17120 states and 17478 transitions. [2019-01-12 04:35:51,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:35:51,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-01-12 04:35:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:51,339 INFO L225 Difference]: With dead ends: 17120 [2019-01-12 04:35:51,339 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:35:51,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:35:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:35:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:35:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:35:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:35:51,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-01-12 04:35:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:51,346 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:35:51,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:35:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:35:51,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:35:51,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:35:51,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,869 WARN L181 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 313 [2019-01-12 04:35:51,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:51,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:52,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:52,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:52,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:52,250 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 313 [2019-01-12 04:35:52,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:52,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:35:52,543 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 279 [2019-01-12 04:35:55,603 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 298 DAG size of output: 118 [2019-01-12 04:35:57,785 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 298 DAG size of output: 118 [2019-01-12 04:35:59,956 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 267 DAG size of output: 113 [2019-01-12 04:35:59,959 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,959 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,959 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,959 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,960 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,961 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,962 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,963 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,964 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,965 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,966 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:35:59,967 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:35:59,968 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,969 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,970 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:35:59,971 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,972 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,973 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:35:59,974 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,975 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,976 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,977 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse28 (+ ~a0~0 98)) (.cse21 (+ ~a0~0 44)) (.cse27 (+ ~a0~0 147)) (.cse18 (+ ~a29~0 144)) (.cse30 (+ ~a4~0 86))) (let ((.cse4 (= ~a2~0 1)) (.cse13 (< 0 .cse30)) (.cse5 (<= ~a29~0 43)) (.cse6 (< 0 .cse18)) (.cse17 (<= (+ ~a4~0 89) 0)) (.cse26 (= ~a2~0 2)) (.cse22 (< 0 .cse27)) (.cse20 (<= 0 .cse21)) (.cse9 (not (= 2 ~a2~0))) (.cse29 (<= .cse30 0)) (.cse8 (< 0 .cse28))) (let ((.cse7 (<= (+ ~a0~0 61) 0)) (.cse11 (or .cse20 (and .cse29 .cse9) (and .cse29 .cse8))) (.cse10 (not (= 1 ~a2~0))) (.cse14 (= ~a2~0 5)) (.cse15 (and .cse17 .cse26 .cse22)) (.cse1 (and .cse4 .cse13 .cse5 .cse6)) (.cse12 (<= 0 (+ ~a29~0 15))) (.cse3 (<= 0 (+ ~a0~0 599999))) (.cse19 (and .cse5 .cse6 (or (and .cse29 .cse4) (and .cse4 .cse20)))) (.cse16 (<= .cse28 0)) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse2 (<= .cse27 0))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse0 .cse9 .cse2) .cse10 .cse3) (and .cse11 .cse7) (and .cse0 .cse12 .cse13 .cse2 .cse3) (and (and .cse0 .cse11) .cse14 .cse12) (and .cse12 .cse15) (and (and (not (= 5 ~a2~0)) .cse0 .cse11) .cse10) (and .cse0 .cse16 .cse14) (and .cse17 .cse2) (and .cse15 (<= .cse18 0)) (and .cse0 .cse1 .cse12 .cse3) (and .cse19 .cse0 .cse20 (<= .cse21 0)) (and .cse19 .cse0 (<= 94 ~a0~0)) (and .cse16 (and .cse0 .cse4 .cse22)) (and .cse16 (exists ((v_prenex_6 Int)) (let ((.cse24 (* 9 v_prenex_6))) (let ((.cse25 (div .cse24 10))) (let ((.cse23 (mod .cse25 29))) (and (<= .cse23 (+ ~a29~0 15)) (not (= 0 .cse23)) (= 0 (mod .cse24 10)) (< .cse25 0)))))) (and .cse0 .cse13 .cse26)) (and .cse16 (and .cse0 (= ~a2~0 3))) (or (and .cse26 (<= (+ ~a0~0 386992) 0)) (and .cse0 .cse13 .cse26 .cse2)))))) [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,978 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,979 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,980 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,981 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,981 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,981 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,981 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse28 (+ ~a0~0 44)) (.cse32 (+ ~a4~0 86))) (let ((.cse29 (+ ~a29~0 144)) (.cse31 (+ ~a0~0 147)) (.cse20 (<= .cse32 0)) (.cse4 (= ~a2~0 1)) (.cse23 (<= 0 .cse28))) (let ((.cse22 (or (and .cse20 .cse4) (and .cse4 .cse23))) (.cse19 (<= (+ ~a4~0 89) 0)) (.cse0 (= ~a2~0 2)) (.cse25 (< 0 .cse31)) (.cse2 (< 0 .cse32)) (.cse5 (<= ~a29~0 43)) (.cse6 (< 0 .cse29)) (.cse7 (<= (+ ~a0~0 61) 0)) (.cse30 (+ ~a0~0 98)) (.cse9 (not (= 2 ~a2~0)))) (let ((.cse14 (or .cse23 (and .cse20 .cse9))) (.cse8 (< 0 .cse30)) (.cse10 (not (= 1 ~a2~0))) (.cse3 (<= .cse31 0)) (.cse26 (or (and .cse4 .cse2 .cse5 .cse6) (and .cse4 .cse5 .cse6 .cse7))) (.cse13 (<= 0 (+ ~a29~0 15))) (.cse11 (<= 0 (+ ~a0~0 599999))) (.cse15 (<= .cse30 0)) (.cse12 (= ~a2~0 5)) (.cse24 (and .cse19 .cse0 .cse25 .cse7)) (.cse21 (<= .cse29 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse27 (and .cse5 .cse6 .cse22))) (or (or (and .cse0 (<= (+ ~a0~0 386992) 0)) (and .cse1 .cse2 .cse0 .cse3)) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse1 .cse9 .cse3) .cse10 .cse11) (and .cse12 .cse13 (and .cse1 .cse14)) (and .cse1 .cse13 .cse2 .cse3 .cse11) (and .cse15 (and .cse1 (= ~a2~0 3))) (and .cse15 (exists ((v_prenex_6 Int)) (let ((.cse17 (* 9 v_prenex_6))) (let ((.cse18 (div .cse17 10))) (let ((.cse16 (mod .cse18 29))) (and (<= .cse16 (+ ~a29~0 15)) (not (= 0 .cse16)) (= 0 (mod .cse17 10)) (< .cse18 0)))))) (and .cse1 .cse2 .cse0)) (and .cse19 .cse3) (and .cse20 .cse21 .cse22) (and .cse14 .cse7) (and (and .cse1 (and (not (= 5 ~a2~0)) (or .cse23 (and .cse20 .cse8)))) .cse10) (and .cse13 .cse24) (and .cse15 (and .cse1 .cse4 .cse25)) (and (and .cse26 .cse1 .cse3) .cse11) (and .cse26 .cse1 .cse13 .cse11) (and .cse1 .cse15 .cse12) (and .cse24 .cse21) (and .cse1 .cse27 .cse23 (<= .cse28 0)) (and .cse1 .cse27 (<= 94 ~a0~0))))))) [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,982 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,983 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,984 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,985 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,986 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,987 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,988 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,989 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,989 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse28 (+ ~a0~0 44)) (.cse32 (+ ~a4~0 86))) (let ((.cse29 (+ ~a29~0 144)) (.cse31 (+ ~a0~0 147)) (.cse20 (<= .cse32 0)) (.cse4 (= ~a2~0 1)) (.cse23 (<= 0 .cse28))) (let ((.cse22 (or (and .cse20 .cse4) (and .cse4 .cse23))) (.cse19 (<= (+ ~a4~0 89) 0)) (.cse0 (= ~a2~0 2)) (.cse25 (< 0 .cse31)) (.cse2 (< 0 .cse32)) (.cse5 (<= ~a29~0 43)) (.cse6 (< 0 .cse29)) (.cse7 (<= (+ ~a0~0 61) 0)) (.cse30 (+ ~a0~0 98)) (.cse9 (not (= 2 ~a2~0)))) (let ((.cse14 (or .cse23 (and .cse20 .cse9))) (.cse8 (< 0 .cse30)) (.cse10 (not (= 1 ~a2~0))) (.cse3 (<= .cse31 0)) (.cse26 (or (and .cse4 .cse2 .cse5 .cse6) (and .cse4 .cse5 .cse6 .cse7))) (.cse13 (<= 0 (+ ~a29~0 15))) (.cse11 (<= 0 (+ ~a0~0 599999))) (.cse15 (<= .cse30 0)) (.cse12 (= ~a2~0 5)) (.cse24 (and .cse19 .cse0 .cse25 .cse7)) (.cse21 (<= .cse29 0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse27 (and .cse5 .cse6 .cse22))) (or (or (and .cse0 (<= (+ ~a0~0 386992) 0)) (and .cse1 .cse2 .cse0 .cse3)) (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and (and .cse1 .cse9 .cse3) .cse10 .cse11) (and .cse12 .cse13 (and .cse1 .cse14)) (and .cse1 .cse13 .cse2 .cse3 .cse11) (and .cse15 (and .cse1 (= ~a2~0 3))) (and .cse15 (exists ((v_prenex_6 Int)) (let ((.cse17 (* 9 v_prenex_6))) (let ((.cse18 (div .cse17 10))) (let ((.cse16 (mod .cse18 29))) (and (<= .cse16 (+ ~a29~0 15)) (not (= 0 .cse16)) (= 0 (mod .cse17 10)) (< .cse18 0)))))) (and .cse1 .cse2 .cse0)) (and .cse19 .cse3) (and .cse20 .cse21 .cse22) (and .cse14 .cse7) (and (and .cse1 (and (not (= 5 ~a2~0)) (or .cse23 (and .cse20 .cse8)))) .cse10) (and .cse13 .cse24) (and .cse15 (and .cse1 .cse4 .cse25)) (and (and .cse26 .cse1 .cse3) .cse11) (and .cse26 .cse1 .cse13 .cse11) (and .cse1 .cse15 .cse12) (and .cse24 .cse21) (and .cse1 .cse27 .cse23 (<= .cse28 0)) (and .cse1 .cse27 (<= 94 ~a0~0))))))) [2019-01-12 04:35:59,989 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:35:59,989 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:35:59,989 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:35:59,990 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,991 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:35:59,992 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,993 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,994 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,995 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,996 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,997 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:35:59,998 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:35:59,999 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:36:00,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,046 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,062 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,063 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,071 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:36:00 BoogieIcfgContainer [2019-01-12 04:36:00,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:36:00,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:36:00,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:36:00,084 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:36:00,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:03" (3/4) ... [2019-01-12 04:36:00,094 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:36:00,156 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:36:00,159 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:36:00,203 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || ((a2 == 5 && 0 <= a29 + 15) && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || ((((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 < a4 + 86) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(1 == a2))) || (0 <= a29 + 15 && ((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 98 <= 0) && a2 == 5)) || ((((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 94 <= a0) [2019-01-12 04:36:00,208 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || ((a2 == 5 && 0 <= a29 + 15) && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || ((((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 < a4 + 86) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(1 == a2))) || (0 <= a29 + 15 && ((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 98 <= 0) && a2 == 5)) || ((((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 94 <= a0) [2019-01-12 04:36:00,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0) && 0 <= a0 + 599999) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 < a4 + 86) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && a2 == 5) && 0 <= a29 + 15)) || (0 <= a29 + 15 && (a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(1 == a2))) || ((a4 + 42 <= 0 && a0 + 98 <= 0) && a2 == 5)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || (((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || (((((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a4 + 42 <= 0) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a4 + 42 <= 0) && 94 <= a0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && a2 == 1) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0) [2019-01-12 04:36:00,490 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:36:00,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:36:00,491 INFO L168 Benchmark]: Toolchain (without parser) took 126277.53 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 947.3 MB in the beginning and 772.7 MB in the end (delta: 174.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,493 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:36:00,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1438.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 198.52 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,494 INFO L168 Benchmark]: Boogie Preprocessor took 194.95 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,495 INFO L168 Benchmark]: RCFGBuilder took 7697.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -115.3 MB). Peak memory consumption was 314.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,498 INFO L168 Benchmark]: TraceAbstraction took 116335.62 ms. Allocated memory was 1.3 GB in the beginning and 3.0 GB in the end (delta: 1.7 GB). Free memory was 1.2 GB in the beginning and 814.6 MB in the end (delta: 379.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,498 INFO L168 Benchmark]: Witness Printer took 407.03 ms. Allocated memory is still 3.0 GB. Free memory was 814.6 MB in the beginning and 772.7 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:00,502 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1438.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -192.7 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 198.52 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 194.95 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: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7697.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -115.3 MB). Peak memory consumption was 314.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116335.62 ms. Allocated memory was 1.3 GB in the beginning and 3.0 GB in the end (delta: 1.7 GB). Free memory was 1.2 GB in the beginning and 814.6 MB in the end (delta: 379.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 407.03 ms. Allocated memory is still 3.0 GB. Free memory was 814.6 MB in the beginning and 772.7 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 121]: 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: 1766]: Loop Invariant [2019-01-12 04:36:00,517 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,518 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,523 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || ((a2 == 5 && 0 <= a29 + 15) && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || ((((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 < a4 + 86) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(1 == a2))) || (0 <= a29 + 15 && ((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 98 <= 0) && a2 == 5)) || ((((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 94 <= a0) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:36:00,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,530 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,535 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,535 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,535 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0)) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || ((a2 == 5 && 0 <= a29 + 15) && a4 + 42 <= 0 && (0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))))) || ((((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 < a4 + 86) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && !(5 == a2) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(1 == a2))) || (0 <= a29 + 15 && ((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (((((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) || (((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) && a4 + 42 <= 0) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || ((a4 + 42 <= 0 && a0 + 98 <= 0) && a2 == 5)) || ((((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a0 + 61 <= 0) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((a4 + 42 <= 0 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && 94 <= a0) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:36:00,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:36:00,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((((((((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a0 + 147 <= 0) && 0 <= a0 + 599999) || (((((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0) && 0 < a0 + 98)) || ((((a4 + 42 <= 0 && !(2 == a2)) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || (((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a29 + 15) && 0 < a4 + 86) && a0 + 147 <= 0) && 0 <= a0 + 599999)) || (((a4 + 42 <= 0 && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && a2 == 5) && 0 <= a29 + 15)) || (0 <= a29 + 15 && (a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147)) || (((!(5 == a2) && a4 + 42 <= 0) && ((0 <= a0 + 44 || (a4 + 86 <= 0 && !(2 == a2))) || (a4 + 86 <= 0 && 0 < a0 + 98))) && !(1 == a2))) || ((a4 + 42 <= 0 && a0 + 98 <= 0) && a2 == 5)) || (a4 + 89 <= 0 && a0 + 147 <= 0)) || (((a4 + 89 <= 0 && a2 == 2) && 0 < a0 + 147) && a29 + 144 <= 0)) || (((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && 0 <= a29 + 15) && 0 <= a0 + 599999)) || (((((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a4 + 42 <= 0) && 0 <= a0 + 44) && a0 + 44 <= 0)) || ((((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a4 + 42 <= 0) && 94 <= a0)) || (a0 + 98 <= 0 && (a4 + 42 <= 0 && a2 == 1) && 0 < a0 + 147)) || ((a0 + 98 <= 0 && (\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0)) && (a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2)) || (a0 + 98 <= 0 && a4 + 42 <= 0 && a2 == 3)) || (a2 == 2 && a0 + 386992 <= 0) || (((a4 + 42 <= 0 && 0 < a4 + 86) && a2 == 2) && a0 + 147 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 116.1s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 88.1s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 3967 SDtfs, 14053 SDslu, 1433 SDs, 0 SdLazy, 37746 SolverSat, 5123 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 76.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2093 GetRequests, 2018 SyntacticMatches, 18 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14444occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 28549 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 148 NumberOfFragments, 1681 HoareAnnotationTreeSize, 4 FomulaSimplifications, 101002 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 72534 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 11728 NumberOfCodeBlocks, 11728 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11707 ConstructedInterpolants, 36 QuantifiedInterpolants, 21705719 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2409 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 12395/13047 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...